Growth of Schreier graphs of automaton groups
classification
🧮 math.GR
math.CO
keywords
graphsautomatongroupsgrowthschreiereverygammagroup
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.