Abstract
We prove that three automorphisms of the rooted binary tree defined by a certain 3-state automaton generate a free non-Abelian group of rank 3.
Similar content being viewed by others
References
Aleshin S.V. (1983) A free group of finite automata. Mosc. Univ. Math. Bull. 38(4): 10–13
Brunner A.M., Sidki S.(1998) The generation of GL(n,\(\mathbb{Z}\)) by finite state automata. Int. J. Algebra Comput. 8(1): 127–139
Glasner Y., Mozes S. (2005) Automata and square complexes. Geom. Dedicata 111, 43–64
Grigorchuk R.I., Nekrashevich V.V., Sushchanskii V.I. (2000) Automata, dynamical systems, and groups. In: Grigorchuk R.I. (ed). Dynamical systems, automata, and infinite groups. Proc. Steklov Inst. Math. 231, 128–203
Nekrashevych, V.: Self-similar Groups. Math. Surveys Monog. 117, Amer. Math. Soc., Providence, RI (2005)
Olijnyk A.S., Sushchanskij V.I. (2000) Free group of infinite unitriangular matrices. Math. Notes 67(3): 320–324
Sidki S. (2000) Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity. J. Math. Sci., NY 100(1): 1925–1943
Author information
Authors and Affiliations
Corresponding author
Additional information
Both authors are supported by the NSF grants DMS-0308985 and DMS-0456185. Yaroslav Vorobets is supported by a Clay Research Scholarship.
Rights and permissions
About this article
Cite this article
Vorobets, M., Vorobets, Y. On a free group of transformations defined by an automaton. Geom Dedicata 124, 237–249 (2007). https://doi.org/10.1007/s10711-006-9060-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10711-006-9060-5