Free subgroups in groups acting on rooted trees

We show that if a group $G$ acting faithfully on a rooted tree $T$ has a free subgroup, then either there exists a point $w$ of the boundary $\partial T$ and a free subgroup of $G$ with trivial stabilizer of $w$, or there exists $w\in\partial T$ and a free subgroup of $G$ fixing $w$ and acting faithfully on arbitrarily small neighborhoods of $w$. This can be used to prove absence of free subgroups for different known classes of groups. For instance, we prove that iterated monodromy groups of expanding coverings have no free subgroups and give another proof of a theorem by S. Sidki.

[1]  V. Nekrashevych.  A minimal Cantor set in the space of 3-generated groups , 2007 .

[2]  R. Grigorchuk.  Degrees of Growth of Finitely Generated Groups, and the Theory of Invariant Means , 1985 .

[3]  R. I. Grigorchuk.  Branch groups , 2005, math/0510294.

[4]  Narain Gupta,et al.  On the Burnside problem for periodic groups , 1983 .

[5]  M. Bhattacharjee,et al.  The Ubiquity of Free Subgroups in Certain Inverse Limits of Groups , 1995 .

[6]  Balint Virag,et al.  Dimension and randomness in groups acting on rooted trees , 2004 .

[7]  Hyman Bass,et al.  Cyclic Renormalization and Automorphism Groups of Rooted Trees , 1995 .

[8]  Tullio Ceccherini-Silberstein,et al.  The Garden of Eden theorem for cellular automata and for symbolic dynamical systems , 2004 .

[9]  Helsedepartementet.  I-12/2002 , 2006 .

[10]  R. Grigorchuk,et al.  Bernside's problem on periodic groups , 1980 .

[11]  Rostislav I. Grigorchuk,et al.  On a Torsion-Free Weakly Branch Group Defined by a Three State Automaton , 2002, Int. J. Algebra Comput..

[12]  Said Sidki,et al.  Automorphisms of one-rooted trees: Growth, circuit structure, and acyclicity , 2000 .

[13]  Volodymyr Nekrashevych,et al.  Rigidity of Branch Groups Acting on Rooted Trees , 2002 .

[14]  Said Sidki,et al.  Finite Automata of Polynomial Growth do Not Generate A Free Group , 2004 .

[15]  M. Vorobets,et al.  On a free group of transformations defined by an automaton , 2006, math/0601231.

[16]  Ievgen Bondarenko,et al.  Post-critically finite self-similar groups , 2007 .

[17]  Laurent Bartholdi,et al.  On amenability of automata groups , 2008, 0802.2837.

[18]  Sergei V. Ivanov.  On the Burnside problem on periodic groups , 1992 .

[19]  R. Grigorchuk,et al.  From fractal groups to fractal sets , 2002, math/0202001.

[20]  On the Growth of Iterated Monodromy Groups , 2004, math/0405456.

[21]  Volodymyr Nekrashevych,et al.  Amenable actions of nonamenable groups , 2007 .

[22]  Wolfgang Woess,et al.  Fractals in Graz 2001 , 2003 .

[23]  Said Sidki,et al.  The Generation of GL(n, Z) by Finite State Automata , 1998, Int. J. Algebra Comput..

[24]  A. Erschler.  Boundary behavior for groups of subexponential growth , 2004 .

[25]  Yair Glasner,et al.  Automata and Square Complexes , 2003 .

[26]  V. Kaimanovich.  Equivalence Relations With Amenable Leaves Need Not Be Amenable , 1997 .

[27]  Volodymyr Nekrashevych,et al.  Self-Similar Groups , 2005, 2304.11232.