加载中…
Every automaton group naturally acts on the space of infinite sequences over some alphabet . For every we consider the Schreier graph of the action of the group on the orbit of . We prove that for a large class of automaton groups all Schreier graphs have subexponential growth bounded above by with some constant . 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本