English

On the representability of sequences as constant terms

Number Theory 2023-07-19 v3

Abstract

A constant term sequence is a sequence of rational numbers whose nn-th term is the constant term of Pn(x)Q(x)P^n(\boldsymbol{x}) Q(\boldsymbol{x}), where P(x)P(\boldsymbol{x}) and Q(x)Q(\boldsymbol{x}) 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.

Keywords

Cite

@article{arxiv.2212.10116,
  title  = {On the representability of sequences as constant terms},
  author = {Alin Bostan and Armin Straub and Sergey Yurkevich},
  journal= {arXiv preprint arXiv:2212.10116},
  year   = {2023}
}
R2 v1 2026-06-28T07:44:09.330Z