Fuchsian holonomic sequences

Many sequences that arise in combinatorics and the analysis of algorithms turn out to be holonomic (note that some authors prefer the terminology D-finite). In this paper, we study various basic algorithmic problems for such sequences (fn)n∈N: how to compute their asymptotics for large n? How to evaluate fn efficiently for large n and/or large precisions p? How to decide whether fn>0 for all n? We restrict our study to the case when the generating function f=∑n∈Nfnzn satisfies a Fuchsian differential equation (often it suffices that the dominant singularities of f be Fuchsian). Even in this special case, some of the above questions are related to long-standing problems in number theory. We will present algorithms that work in many cases and we carefully analyze what kind of oracles or conjectures are needed to tackle the more difficult cases.