Back to Search
Start Over
Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton
- Publication Year :
- 2021
-
Abstract
- Certain famous combinatorial sequences, such as the Catalan numbers and the Motzkin numbers, when taken modulo a prime power, can be computed by finite automata. Many theorems about such sequences can therefore be proved using Walnut, which is an implementation of a decision procedure for proving various properties of automatic sequences. In this paper we explore some results (old and new) that can be proved using this method.<br />Comment: 14 pages, 12 figures
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2110.06244
- Document Type :
- Working Paper