Related papers: Some non-contracting automata groups
We provide a class of non-contracting groups containing an infinite family of fractal and weakly regular branch groups, and study certain properties including abelianization, just infiniteness, and word problem. We present an example of a…
Classification of groups generated by 3-state automata over a 2-letter alphabet started in the first paper (see http://www.arxiv.org/abs/math/0612178) is continued.
We give a new example of an automata group of intermediate growth. It is generated by an automaton with 4 states on an alphabet with 8 letters. This automata group has exponential activity and its limit space is not simply connected.
We construct the groups $<A,B,C \;| \, A^2,B^2,C^2,(ABC)^2>$ and $<A,B \;| \, A^2,B^4,(AB)^4>$, using 3-state automata over the alphabets $\{1,2,3\}$ and $\{1,2,3,4\}$. In addition, we show, how to define direct powers of $G$ by automaton…
In this article we construct asynchronous and sometimes synchronous automatic structures for amalgamated products and HNN extensions of groups that are strongly asynchronously (or synchronously) coset automatic with respect to the…
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.
The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism)…
We classify those 2-groups G which factorise as a product of two disjoint cyclic subgroups A and B, transposed by an automorphism of order 2. The case where G is metacyclic having been dealt with elsewhere, we show that for each e>2 there…
We give a short proof that every contracting self-similar group embeds into a finitely presented simple group. In particular, any contracting self-similar group embeds into the corresponding R\"over--Nekrashevych group, and this in turn…
This paper explores a previously uncharted automaton group generated by a 5-state automaton $(\Pi, A)$ acts by self-similarity on the regular rooted tree $A^{*}$ over a 2-letter alphabet set $A$. Group $G$ has been subjected to several…
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…
We begin the investigation of Gamma-limit groups, where Gamma is a torsion-free group which is hyperbolic relative to a collection of free abelian subgroups. Using the results of Drutu and Sapir, we adapt the results from math.GR/0404440 to…
A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…
We define a new notion of contracting element of a group and we show that contracting elements coincide with hyperbolic elements in relatively hyperbolic groups, pseudo-Anosovs in mapping class groups, rank one isometries in groups acting…
In this paper, we establish that, for statistically convex-cocompact actions, contracting elements are exponentially generic in counting measure. Among others, the following exponential genericity results are obtained as corollaries for the…
It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a…
We discuss a problem posed by Gersten: Is every automatic group which does not contain Z+Z subgroup, hyperbolic? To study this question, we define the notion of "n-tracks of length n", which is a structure like Z+Z, and prove its existence…
Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…
The following discourse is inspired by the works on hyperbolic groups of Epstein, and Neumann/Reeves. Epstein showed that geometrically finite hyperbolic groups are biautomatic. Neumann/Reeves showed that virtually central extensions of…
We prove that the abstract commensurator of a nonabelian free group, an infinite surface group, or more generally of a group that splits appropriately over a cyclic subgroup, is not finitely generated. This applies in particular to all…