Article Dans Une Revue Applicable Algebra in Engineering, Communication and Computing Année : 2023

Fuchsian holonomic sequences

Résumé

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 (f_n)_{n∈ℕ} : how to compute their asymptotics for large n? How to evaluate f_n efficiently for large n and/or large precisions p? How to decide whether f_n > 0 for all n? We restrict our study to the case when the generating function f = ∑_{n∈ℕ} f_n z^n 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.

Fichier principal
Vignette du fichier
fuchsianseq.pdf (383.72 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-03291372 , version 1 (19-07-2021)
hal-03291372 , version 2 (26-08-2022)

Licence

Identifiants

Citer

Joris van der Hoeven. Fuchsian holonomic sequences. Applicable Algebra in Engineering, Communication and Computing, 2023, ⟨10.1007/s00200-023-00616-4⟩. ⟨hal-03291372v2⟩
271 Consultations
731 Téléchargements

Altmetric

Partager

  • More