Growth of Schreier graphs of automaton groups

Details Growth of Schreier graphs of automaton groups Growth of Schreier graphs of automaton groups

2011-01-17

arxiv.org/abs/1101.3200v1

Mathematics

Group Theory

20 pages, 4 figures

Scientific paper

Every automaton group naturally acts on the space $X^\omega$ of infinite sequences over some alphabet $X$. For every $w\in X^\omega$ we consider the Schreier graph $\Gamma_w$ of the action of the group on the orbit of $w$. We prove that for a large class of automaton groups all Schreier graphs $\Gamma_w$ have subexponential growth bounded above by $n^{(\log n)^m}$ with some constant $m$. In particular, this holds for all groups generated by automata with polynomial activity growth (in terms of S.Sidki), confirming a conjecture of V.Nekrashevych. We present applications to omega-periodic graphs and Hanoi graphs.

Affiliated with

Also associated with

No associations

Rating

Growth of Schreier graphs of automaton groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Growth of Schreier graphs of automaton groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Growth of Schreier graphs of automaton groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286050