2000 character limit reached
Generalized Lucas congruences and linear $p$-schemes
Published 16 Nov 2021 in math.NT and math.CO | (2111.08641v1)
Abstract: We observe that a sequence satisfies Lucas congruences modulo $p$ if and only if its values modulo $p$ can be described by a linear $p$-scheme, as introduced by Rowland and Zeilberger, with a single state. This simple observation suggests natural generalizations of the notion of Lucas congruences. To illustrate this point, we prove explicit generalized Lucas congruences for integer sequences that can be represented as the constant terms of $P(x,y)n Q(x,y)$ where $P$ and $Q$ are certain Laurent polynomials.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.