A method for determining the mod-p^k behaviour of recursive sequences

MaRDI QIDQ6264442zbMATH OpenFDO

Authors C. Krattenthaler, T. W. Müller

Publication date 11 August 2015

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Exact enumeration problems, generating functions (05A15) Algebraic combinatorics (05E99) Congruences; primitive roots; residue systems (11A07)

Abstract: We present a method for obtaining congruences modulo powers of a prime number~

p

for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors [Electron. J. Combin. 8(2) (2012), Art. P37; arXiv:1107.2015] from

p = 2

to arbitrary primes. Our applications include congruences for numbers of non-crossing graphs and numbers of Kreweras walks modulo powers of~

3

, as well as congruences for Fuss-Catalan numbers and blossom tree numbers modulo powers of arbitrary primes.

This page was built for publication: A method for determining the mod-$p^k$ behaviour of recursive sequences

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