Restricted walks in regular trees
The electronic journal of combinatorics, Tome 13 (2006)
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl EuDML
Let ${\cal T}$ be the Cayley graph of a finitely generated free group $F$. Given two vertices in ${\cal T}$ consider all the walks of a given length between these vertices that at a certain time must follow a number of predetermined steps. We give formulas for the number of such walks by expressing the problem in terms of equations in $F$ and solving the corresponding equations.
Laura Ciobanu; Saša Radomirović. Restricted walks in regular trees. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1119
@article{10_37236_1119,
author = {Laura Ciobanu and Sa\v{s}a Radomirovi\'c},
title = {Restricted walks in regular trees},
journal = {The electronic journal of combinatorics},
year = {2006},
volume = {13},
doi = {10.37236/1119},
zbl = {1112.05049},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1119/}
}
Cité par Sources :