Generalized Lucas congruences and linear p-schemes

DOI10.1016/J.AAM.2022.102409MaRDI QIDQ2168565zbMATH OpenOpenAlexWikidataFDO

Authors Joel A. Henningsen, Armin Straub

Publication date 31 August 2022

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2111.08641

Apeŕy-like number Catalan number linear \(p\)-scheme Lucas congruence

Congruences; primitive roots; residue systems (11A07) Binomial coefficients; factorials; (q)-identities (11B65) Special sequences and polynomials (11B83)

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.

Review text

Let \(p\) be a prime, and \(A(n)\) be an integer sequence. If for any positive integer \(n=n_0+n_1p+\cdots+n_rp^r\) with \(n_0,n_1,\ldots,n_r\in\{0,1,\ldots,p-1\}\) we have \(A(n)\equiv A(n_0)A(n_1)\cdots A(n_r)\pmod p\), we say that the sequence \(A(n)\) satisfies the Lucas congruence modulo \(p\). In the paper, the authors reveal the connections between the sequence satisfies the so-called generalized Lucas congruences modulo prime powers and the sequence represented as the constant terms of \(P(x,y)^nQ(x,y)\), where \(P\) and \(Q\) are certain Laurent polynomials.

Recommendations

Cites work

Cited in

(9)

Describes a project that uses

Uses Software

This page was built for publication: Generalized Lucas congruences and linear \(p\)-schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168565)