Restricted walks in regular trees (Q870011)

Summary: Let \(\mathcal T\) be the Cayley graph of a finitely generated free group \(F\). Given two vertices in \(\mathcal 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.