G-functions and multisum versus holonomic sequences
Stavros Garoufalidis

TL;DR
This paper explores the properties of sequences derived from hypergeometric sums, constructs related G-functions from combinatorics, and addresses a question about the representation of holonomic sequences, combining analytic and combinatorial methods.
Contribution
It proves that multidimensional sums of balanced hypergeometric terms have Gevrey-type asymptotic expansions, constructs new G-functions from combinatorics, and provides a counterexample to a question on holonomic sequences.
Findings
Sequences from hypergeometric sums have Gevrey-1 asymptotics with rational exponents.
Constructed G-functions originate from enumerative combinatorics.
Counterexample shows not all holonomic sequences are multisums of balanced hypergeometric terms.
Abstract
The purpose of the paper is three-fold: (a) we prove that every sequence which is a multidimensional sum of a balanced hypergeometric term has an asymptotic expansion of Gevrey type-1 with rational exponents, (b) we construct a class of -functions that come from enumerative combinatorics, and (c) we give a counterexample to a question of Zeilberger that asks whether holonomic sequences can be written as multisums of balanced hypergeometric terms. The proofs utilize the notion of a -function, introduced by Siegel, and its analytic/arithmetic properties shown recently by Andr\'e.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Geometry · Mathematical functions and polynomials · Coding theory and cryptography
