English

A Linear Representation for Constant Term Sequences mod $p^a$ with Applications to Uniform Recurrence

Combinatorics 2025-03-31 v1 Representation Theory

Abstract

Many integer sequences including the Catalan numbers, Motzkin numbers, and the Apr{\'e}y numbers can be expressed in the form ConstantTermOf[PnQ]\left[P^nQ\right] for Laurent polynomials PP and QQ. These are often called ``constant term sequences''. In this paper, we characterize the prime powers, pap^a, for which sequences of this form modulo pap^a, and others built out of these sequences, are uniformly recurrent. For all other prime powers, we show that the frequency of 00 is 11. This is accomplished by introducing a novel linear representation of constant term sequences modulo pap^a, which is of independent interest.

Keywords

Cite

@article{arxiv.2503.21988,
  title  = {A Linear Representation for Constant Term Sequences mod $p^a$ with Applications to Uniform Recurrence},
  author = {Nadav Kohen},
  journal= {arXiv preprint arXiv:2503.21988},
  year   = {2025}
}

Comments

17 pages

R2 v1 2026-06-28T22:37:24.680Z