Restricted walks in regular trees

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Article numberR93
JournalElectronic Journal of Combinatorics
Volume13
Publication statusPublished - 27 Oct 2006

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Restricted walks in regular trees'. Together they form a unique fingerprint.

  • Cite this