Related papers: A connected 3-state reversible Mealy automaton can…
We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such…
We construct automata over a binary alphabet with $2n$ states, $n\geq 2$, whose states freely generate a free group of rank $2n$. Combined with previous work, this shows that a free group of every finite rank can be generated by finite…
It is well known there is no finitely generated abelian group which has the $R_\infty$ property. We will show that also many non-finitely generated abelian groups do not have the $R_\infty$ property, but this does not hold for all of them.…
We construct a CAT(0) group containing a finitely presented subgroup with infinitely many conjugacy classes of finite-order elements. Unlike previous examples (which were based on right-angled Artin groups) our ambient CAT(0) group does not…
We show presentations of automata groups generated by Cayley machines of finite groups of nilpotency class two and these automata groups are all cross-wired lamplighters.
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions…
(Free-abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and…
We give sufficient conditions for when groups generated by automata in a class $\mathcal{C}$ of transducers, which contains the class of reset automata transducers, have infinite order. As a consequence we also demonstrate that if a group…
We prove that there exists a finitely generated group that satisfies a group law with probability 1 but does not satisfy any group law. More precisely, we construct a finitely generated group G in which the probability that a random element…
Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…
Define a Garside monoid to be a cancellative monoid where right and left lcm's exist and that satisfy additional finiteness assumptions, and a Garside group to be the group of fractions of a Garside monoid. The family of Garside groups…
We construct novel examples of finitely generated groups that exhibit seemingly-contradicting probabilistic behaviors with respect to Burnside laws. We construct a finitely generated group that satisfies a Burnside law, namely a law of the…
Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems. In this paper, we consider a generalization…
In this note we present an algorithm for the construction of the unit group of the Burnside ring $\Omega(G)$ of a finite group $G$ from a list of representatives of the conjugacy classes of subgroups of G.
Box--ball systems (BBS) are integrable systems with soliton solutions and other good properties. We will search for automata that belong to the same class as BBS automata by introducing some classes of automata through the features of BBS…
We report here on the structure of reversible quantum cellular automata with the additional restriction that these are also Clifford operations. This means that tensor products of Weyl operators (projective representation of a finite…
The RP-property of Fel'shtyn and Troitsky is proved for wreath products of finitely generated Abelian groups with the group of integers. Such wreath products become the first known example of finitely generated RP-groups being not almost…
We study the class of groups generated by automata that act essentially freely on the boundary of a rooted tree. In the process we establish and discuss some general tools for determining if a group belongs to this class, and explore the…
This article contains most of the known results on the classification of groups generated by 3-state automata over a 2-letter alphabet, extending the previous papers 0704.3876 and math/0612178.
We consider the two generalizations of lamplighter groups: automata groups generated by Cayley machine and cross-wired lamplighter groups. For a finite step two nilpotent group with central squares, we study its associated Cayley machine…