Restricted walks in regular trees

MaRDI QIDQ870011zbMATH OpenFDO

Authors Laura Ciobanu, Saša Radomirović

Publication date 12 March 2007

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/127340, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r93.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Cayley graph

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Free nonabelian groups (20E05)

Review text

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.

Recommendations

• On the walks on Cayley graphs
• scientific article; zbMATH DE number 3949430
• scientific article; zbMATH DE number 2127755
• scientific article; zbMATH DE number 3862178
• Finite range random walk on free groups and homogeneous trees

Cited in

(2)

• On the walks on Cayley graphs
• The post correspondence problem and equalisers for certain free group and monoid morphisms

This page was built for publication: Restricted walks in regular trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870011)