Restricted walks in regular trees (Q870011): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 02:27, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Restricted walks in regular trees |
scientific article |
Statements
Restricted walks in regular trees (English)
0 references
12 March 2007
0 references
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.
0 references
Cayley graph
0 references
