Restricted walks in regular trees (Q870011)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5132806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Restricted walks in regular trees |
scientific article; zbMATH DE number 5132806 |
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
0.7889302968978882
0 references
0.7366877198219299
0 references
