Narayana in Walnut
How to prove properties of Narayana’s cow sequence in Walnut
A.A. Mendels (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Robbert Fokkink – Mentor (TU Delft - Applied Probability)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
This thesis investigates properties of the Narayana sequence, a combinatorial sequence with recursive and morphic structure. We prove several known characteristics of the sequence. We then introduce the Walnut Prover, a tool for automating logical reasoning over automatic sequences. We describe its capabilities and limitations, and apply it to explore additional properties of the Narayana sequence.