English

The Membership Problem for Hypergeometric Sequences with Rational Parameters

Logic in Computer Science 2022-05-25 v2 Symbolic Computation

Abstract

We investigate the Membership Problem for hypergeometric sequences: given a hypergeometric sequence unn=0\langle u_n \rangle_{n=0}^\infty of rational numbers and a target tQt \in \mathbb{Q}, decide whether tt occurs in the sequence. We show decidability of this problem under the assumption that in the defining recurrence p(n)un=q(n)un1p(n)u_{n}=q(n)u_{n-1}, the roots of the polynomials p(x)p(x) and q(x)q(x) are all rational numbers. Our proof relies on bounds on the density of primes in arithmetic progressions. We also observe a relationship between the decidability of the Membership problem (and variants) and the Rohrlich-Lang conjecture in transcendence theory.

Keywords

Cite

@article{arxiv.2202.07416,
  title  = {The Membership Problem for Hypergeometric Sequences with Rational Parameters},
  author = {Klara Nosan and Amaury Pouly and Mahsa Shirmohammadi and James Worrell},
  journal= {arXiv preprint arXiv:2202.07416},
  year   = {2022}
}
R2 v1 2026-06-24T09:38:09.455Z