A Case Study in Meta-AUTOMATION: AUTOMATIC Generation of Congruence AUTOMATA For Combinatorial Sequences

Abstract

This article is a sequel to a recent article by Eric Rowland and Reem Yassawi, presenting yet another approach to the fast determination of congruence properties of `famous' combinatorial sequences. The present approach can be taught to a computer, and our beloved servant, Shalosh B. Ekhad, was able to generate many new theorems, for famous sequences, of course, but also for many obscure ones!

17 pages, accompanied by Maple packages

References in corpus (1)

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

Cited by in corpus (6)

• $p$-adic asymptotic properties of constant-recursive sequences
• Right-jumps and pattern avoiding permutations
• A Meta-Algorithm for Creating Fast Algorithms for Counting ON Cells in Odd-Rule Cellular Automata
• The MHS algebra and supercongruences
• On the period mod $m$ of polynomially-recursive sequences: a case study
• Automated Discovery and Proof of Congruence Theorems for Partial Sums of Combinatorial Sequences