Counting closed walks in infinite regular trees using Catalan and Borel's triangles
Abstract
We count the number of closed walks on a vertex in a regular tree using the Catalan's triangle and also the Borel's triangle, showing another combinatorial structure counted by these two array of numbers.
- Publication:
-
arXiv e-prints
- Pub Date:
- December 2022
- DOI:
- 10.48550/arXiv.2212.08795
- arXiv:
- arXiv:2212.08795
- Bibcode:
- 2022arXiv221208795K
- Keywords:
-
- Mathematics - Combinatorics;
- 05A19;
- 05A10;
- 05C30