English

Growth of Schreier graphs of automaton groups

Group Theory 2014-09-02 v2 Combinatorics

Abstract

Every automaton group naturally acts on the space XωX^\omega of infinite sequences over some alphabet XX. For every wXωw\in X^\omega we consider the Schreier graph Γw\Gamma_w of the action of the group on the orbit of ww. We prove that for a large class of automaton groups all Schreier graphs Γw\Gamma_w have subexponential growth bounded above by n(logn)mn^{(\log n)^m} with some constant mm. 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.

Keywords

Cite

@article{arxiv.1101.3200,
  title  = {Growth of Schreier graphs of automaton groups},
  author = {Ievgen Bondarenko},
  journal= {arXiv preprint arXiv:1101.3200},
  year   = {2014}
}

Comments

21 pages, 3 figures