On the representability of sequences as constant terms
Alin Bostan (MATHEXP), Armin Straub, Sergey Yurkevich (MATHEXP)

TL;DR
This paper classifies which sequences, defined as constant terms of polynomial powers, can be represented as diagonals of rational functions, focusing on linear recurrence and hypergeometric sequences.
Contribution
It provides a classification of constant term sequences as diagonals for linear recurrences and certain hypergeometric sequences, addressing a question posed by Don Zagier.
Findings
Classified constant term sequences satisfying linear recurrences.
Identified hypergeometric sequences that are constant terms.
Connected constant term sequences to diagonals of rational functions.
Abstract
A constant term sequence is a sequence of rational numbers whose -th term is the constant term of , where and are multivariate Laurent polynomials. While the generating functions of such sequences are invariably diagonals of multivariate rational functions, and hence special period functions, it is a famous open question, raised by Don Zagier, to classify diagonals that are constant terms. In this paper, we provide such a classification in the case of sequences satisfying linear recurrences with constant coefficients. We also consider the case of hypergeometric sequences and, for a simple illustrative family of hypergeometric sequences, classify those that are constant terms.
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 Combinatorial Mathematics · semigroups and automata theory · Advanced Mathematical Identities
