Automatic congruences for diagonals of rational functions

DOI10.5802/JTNB.901zbMath1384.11003arXiv1310.8635OpenAlexW3099198586MaRDI QIDQ259509

Reem Yassawi, Eric S. Rowland

Publication date: 11 March 2016

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Automata sequences (11B85) Sequences (mod (m)) (11B50)

Related Items (20)

Lucas’ Theorem Modulo p² ⋮ Automata and finite order elements in the Nottingham group ⋮ Divisibility properties of sporadic Apéry-like numbers ⋮ On congruence schemes for constant terms and their applications ⋮ Lucas congruences for the Ap\'ery numbers modulo $p^2$ ⋮ Motzkin numbers and related sequences modulo powers of 2 ⋮ Generalized Lucas congruences and linear \(p\)-schemes ⋮ Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton ⋮ On the representability of sequences as constant terms ⋮ Gessel-Lucas congruences for sporadic sequences ⋮ Congruences for Apéry numbers βn =∑k=0nn k2n+k k ⋮ Generalised Apéry numbers modulo 9 ⋮ Two kinds of partial Motzkin paths with air pockets ⋮ Profinite automata ⋮ \(p\)-adic asymptotic properties of constant-recursive sequences ⋮ Cayley graphs and automatic sequences ⋮ A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences ⋮ Artwork based on automatic sequences ⋮ \(p\)-linear schemes for sequences modulo \(p^{r}\) ⋮ Criteria for the integrality of \(n\)th roots of power series

Uses Software

• OEIS
• AutoSquared
• BinaryTrees
• CatalanCC
• MotzkinCC
• DelannoyLS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method for determining the mod-\(2^k\) behaviour of recursive sequences, with applications to subgroup counting
• Generalised Apéry numbers modulo 9
• A characterization of \(p\)-automatic sequences as columns of linear cellular automata
• Multivariate Apéry numbers and supercongruences of rational functions
• A short approach to Catalan numbers modulo \(2^r\)
• On vanishing coefficients of algebraic power series over fields of positive characteristic
• Dwork congruences and reflexive polytopes
• Lucas' theorem for prime powers
• Catalan and Motzkin numbers modulo 4 and 8
• Pattern avoidance in binary trees
• Algebraic power series and diagonals
• Congruence properties of Apéry numbers
• Some congruences for Apery numbers
• The ring of \(k\)-regular sequences
• Permutations which are the union of an increasing and a decreasing subsequence
• The permutation classes equinumerous to the smooth class
• The asymptotic distribution of elements in automatic sequences
• Prime and prime power divisibility of Catalan numbers
• Periodicity, repetitions, and orbits of an automatic sequence
• Congruences for Catalan and Motzkin numbers and related sequences
• Algebraic functions over finite fields
• Wilf classes of pairs of permutations of length 4
• Odd Catalan Numbers Modulo
• Suites algébriques, automates et substitutions
• Automatic Sequences
• Arithmetic properties of Apéry-like numbers
• A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences
• Diagonalization and Rationalization of algebraic Laurent series

This page was built for publication: Automatic congruences for diagonals of rational functions