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!
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.