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.
|Number of pages||18|
|Journal||Electronic Journal of Combinatorics|
|Publication status||Published - 27 Oct 2006|