Related papers: Some non-contracting automata groups
An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related to the whole class are formulated. In particular, all finite,…
We show that the automorphism groups of right-angled Artin groups whose defining graphs have at least 3 vertices are not relatively hyperbolic. We then show that the outer automorphism groups are not relatively hyperbolic, if they are not…
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 is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
We describe in terms of automata theory the automatic actions with post-critically finite limit space. We prove that these actions are precisely the actions by bounded automata and that any self-similar action by bounded automata is…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…
We prove groups acting cocompactly on locally finite trees with hyperbolic vertex stabilisers are asynchronously automatic. Combining this with previous work of the authors, we obtain an example of a group satisfying several non-positive…
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.
Nekrashevych algebras of self-similar group actions are natural generalizations of the classical Leavitt algebras. They are discrete analogues of the corresponding Nekrashevych $C^\ast$-algebras. In particular, Nekrashevych, Clark, Exel,…
For a large class of groups, we exhibit an infinite-dimensional space of homogeneous quasimorphisms that are invariant under the action of the automorphism group. This class includes non-elementary hyperbolic groups, infinitely-ended…
We show, that groups, defined by wide class of automata, including all polynomial ones, act on the set of infinite words not paradoxical
In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…
To reinforce the analogy between the mapping class group and the Cremona group of rank $2$ over an algebraic closed field, we look for a graph analoguous to the curve graph and such that the Cremona group acts on it non-trivially. A…
The notions of nonpositive curved spaces and biautomatic groups are generalizations of the geometric properties of hyperbolic spaces and computational properties of their fundamental groups. Given the mutual origins of these conditions, one…
We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…
In this article we construct a piecewise Euclidean, non-positively curved 2-complex for the 3-generator Artin groups of large type. As a consequence we show that these groups are biautomatic. A slight modification of the proof shows that…
In this paper we study the word problem of groups corresponding to tessellations of the hyperbolic plane. In particular using the Fibonacci technology developed by the second author we show that groups corresponding to the pentagrid or the…
We study the action of groups generated by bounded activity automata with infinite alphabets on their orbital Schreier graphs. We introduce an amenability criterion for such groups based on the recurrence of the first level action. This…
In a seminal paper, Brin demonstrates that the outerautomorphism group of Thompson group $T$ is isomorphic to the cyclic group of order two. In this article, building on characterisation of automorphisms of the Higman-Thompson groups…