Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton (Q2170788)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton |
scientific article; zbMATH DE number 7582306
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton |
scientific article; zbMATH DE number 7582306 |
Statements
Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton (English)
0 references
6 September 2022
0 references
Summary: 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.
0 references
0 references
