A Case Study in Meta-AUTOMATION: AUTOMATIC Generation of Congruence AUTOMATA For Combinatorial Sequences
Combinatorics
2014-08-05 v1
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!
Keywords
Cite
@article{arxiv.1311.4776,
title = {A Case Study in Meta-AUTOMATION: AUTOMATIC Generation of Congruence AUTOMATA For Combinatorial Sequences},
author = {Eric Rowland and Doron Zeilberger},
journal= {arXiv preprint arXiv:1311.4776},
year = {2014}
}
Comments
17 pages, accompanied by Maple packages