A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
نویسندگان
چکیده
The class of automaton groups is a rich source of the simplest examples of infinite Burnside groups. However, there are some classes of automata that do not contain such examples. For instance, all infinite Burnside automaton groups in the literature are generated by non reversible Mealy automata and it was recently shown that 2-state invertible-reversible Mealy automata cannot generate infinite Burnside groups. Here we extend this result to connected 3-state invertiblereversible Mealy automata, using new original techniques. The results provide the first uniform method to construct elements of infinite order in each infinite group in this class.
منابع مشابه
Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups
The simplest example of an infinite Burnside group arises in the class of automaton groups. However there is no known example of such a group generated by a reversible Mealy automaton. It has been proved that, for a connected automaton of size at most 3, or when the automaton is not bireversible, the generated group cannot be Burnside infinite. In this paper, we extend these results to automata...
متن کاملTo Infinity and Beyond
We prove that if a group generated by a bireversible Mealy automaton contains an element of infinite order, its growth blows up and is necessarily exponential. As a direct consequence, no infinite virtually nilpotent group can be generated by a bireversible Mealy automaton. The study on how (semi)groups grow has been highlighted since Milnor’s question on the existence of groups of intermediate...
متن کاملThe finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy automata and to the decidability of freeness for semigroups generated by two-letter invertible-reversible Mealy automata.
متن کاملOn level-transitivity and exponential growth
We prove that if the group generated by an invertible and reversible Mealy automaton acts level-transitively on a regular rooted tree, then the semigroup generated by the dual automaton has exponential growth, hence giving a decision procedure of exponential growth for a restricted family of automaton (semi)groups. The purpose of this note is to link up two classes of groups and semigroups high...
متن کاملAn analogue to Dixon's theorem for automaton groups
Dixon’s famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that it is hopeless to wish for a uniform distribution – or even a non-trivial one – by drawing random permutations and looking at the generated group. Mealy aut...
متن کامل