On congruence schemes for constant terms and their applications
From MaRDI portal
Publication:2153900
DOI10.1007/s40993-022-00337-6zbMath1496.11005arXiv2205.09902OpenAlexW4283781783WikidataQ114218018 ScholiaQ114218018MaRDI QIDQ2153900
Publication date: 13 July 2022
Published in: Research in Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.09902
Formal languages and automata (68Q45) Recurrences (11B37) Congruences; primitive roots; residue systems (11A07)
Related Items (2)
On the representability of sequences as constant terms ⋮ Gessel-Lucas congruences for sporadic sequences
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Automatic congruences for diagonals of rational functions
- Multiple binomial sums
- Catalan and Motzkin numbers modulo 4 and 8
- Algebraic power series and diagonals
- Congruence properties of Apéry numbers
- Some congruences for Apery numbers
- The ring of \(k\)-regular sequences
- A proof that Euler missed. Apéry's proof of the irrationality of \(\zeta(3)\). An informal report
- The arithmetic and topology of differential equations
- \textsc{IntegerSequences}: a package for computing with \(k\)-regular sequences
- Congruences for Catalan and Motzkin numbers and related sequences
- Suites algébriques, automates et substitutions
- Automatic Sequences
- Gauss congruences for rational functions in several variables
- A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences
- Catalan Numbers
- New Representations for all Sporadic Apéry-Like Sequences, With Applications to Congruences
This page was built for publication: On congruence schemes for constant terms and their applications
