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 for Laurent polynomials and . These are often called ``constant term sequences''. In this paper, we characterize the prime powers, , for which sequences of this form modulo , and others built out of these sequences, are uniformly recurrent. For all other prime powers, we show that the frequency of is . This is accomplished by introducing a novel linear representation of constant term sequences modulo , 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