Linear-exponent bounds for the automatic complexity of rational diagonals modulo prime powers
math.GM
Submitted: 2026-11-01
Updated: 2026-11-01
Terminology
Sources
- A sharper multivariate Christol's theorem with applications to diagonals and Hadamard products
- $p$-Linear schemes for sequences modulo $p^r$
- Dwork crystals I
- Automatic Sequences and Curves over Finite Fields
- Generalized Lucas congruences and linear $p$-schemes
- An elementary proof of Bridy's theorem
- Algebraic power series and their automatic complexity modulo prime powers
- On congruence schemes for constant terms and their applications
- Gessel-Lucas congruences for sporadic sequences
- Higher Hasse--Witt matrices
Related papers
- Compact Coefficient Formulae for Logarithmic Tangent and Hyperbolic Integrals
- A systematic approach to Diophantine equations: open problems
- Indefinite integrals of Bessel and Struve functions with half-integer indices, and incomplete gamma functions with integer indices, all multiplied by Exp(-ax squared) and divided by powers
- Polynomial Z-contraction: A unified approach with Application