On a free group of transformations defined by an automaton.
From MaRDI portal
Publication:2642671
DOI10.1007/S10711-006-9060-5zbMATH Open1183.20024arXivmath/0601231OpenAlexW2017753860MaRDI QIDQ2642671FDOQ2642671
Authors: Mariya Vorobets, Yaroslav Vorobets 
Publication date: 17 August 2007
Published in: Geometriae Dedicata (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0601231
Recommendations
Free nonabelian groups (20E05) Groups acting on trees (20E08) Generators, relations, and presentations of groups (20F05)
Cites Work
- Title not available (Why is that?)
- Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
- Automata and square complexes.
- Automata, dynamical systems, and groups
- Free group of infinite unitriangular matrices
- The Generation of GL(n, Z) by Finite State Automata
- A free group of finite automata
Cited In (37)
- Freeness of automaton groups vs boundary dynamics
- The concept of duality for automata over a changing alphabet and generation of a free group by such automata
- Some topics in the dynamics of group actions on rooted trees.
- Fragile words and Cayley type transducers
- On the transition monoid of the Stallings automaton of a subgroup of a free group
- Free and non-free subgroups of the group \(\mathrm{UT}(\infty,\mathbb Z)\).
- Automaton semigroups: the two-state case.
- Combinatorial models of expanding dynamical systems
- Catalan fragile words
- A geometric approach to (semi)-groups defined by automata via dual transducers.
- Automaton ranks of some self-similar groups.
- Boundary dynamics for bireversible and for contracting automaton groups
- Automata generating free products of groups of order 2.
- Automaton groups and complete square complexes
- The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata
- Finite automaton actions of free groups
- On a series of finite automata defining free transformation groups.
- Free groups defined by finite $p$-automata
- Functionally recursive rings of matrices -- two examples
- Rational embeddings of hyperbolic groups
- Orbit automata as a new tool to attack the order problem in automaton groups
- Automaton representation of a free group
- Automata over a binary alphabet generating free groups of even rank.
- Generic properties in some classes of automaton groups
- Finite automata of polynomial growth do not generate a free group.
- On groups generated by bi-reversible automata: the two-state case over a changing alphabet
- The lamplighter group of rank two generated by a bireversible automaton
- On the lattice of subgroups of the lamplighter group.
- The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet
- Extensions of automorphisms of self-similar groups
- Lamplighter groups, bireversible automata, and rational series over finite rings
- Geometric representations of interacting maps
- Asymptotic aspects of Schreier graphs and Hanoi Towers groups.
- Virtual endomorphisms of nilpotent groups.
- An automaton group with \textsf{PSPACE}-complete word problem
- Finite self-similar \(p\)-groups with Abelian first level stabilizers.
- Lifts, derandomization, and diameters of Schreier graphs of Mealy automata
This page was built for publication: On a free group of transformations defined by an automaton.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642671)
