Abstract
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in 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.
Original language | English |
---|---|
Article number | R93 |
Pages (from-to) | 1-18 |
Number of pages | 18 |
Journal | Electronic Journal of Combinatorics |
Volume | 13 |
Publication status | Published - 27 Oct 2006 |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics