The degree of a q-holonomic sequence is a quadratic quasi-polynomial

30Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

A sequence of rational functions in a variable q is q-holonomic if it satisfies a linear recursion with coefficients polynomials in q and qn. We prove that the degree of a q-holonomic sequence is eventually a quadratic quasi-polynomial, and that the leading term satisfies a linear recursion relation with constant coefficients. Our proof uses differential Galois theory (adapting proofs regarding holonomic Dmodules to the case of q-holonomic D-modules) combined with the Lech-Mahler- Skolem theorem from number theory. En route, we use the Newton polygon of a linear q-difference equation, and introduce the notion of regular-singular q-difference equation and aWKB basis of solutions of a linear q-difference equation at q = 0. We then use the Skolem-Mahler-Lech theorem to study the vanishing of their leading term. Unlike the case of q = 1, there are no analytic problems regarding convergence of the WKB solutions. Our proofs are constructive, and they are illustrated by an explicit example.

Cite

CITATION STYLE

APA

Garoufalidis, S. (2011). The degree of a q-holonomic sequence is a quadratic quasi-polynomial. Electronic Journal of Combinatorics, 18(2), 1–23. https://doi.org/10.37236/2000

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free