Related papers: Automaticity for graphs of groups
We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…
The history, definition and principal properties of automatic groups and their generalisations to subgroups and cosets are reviewed briefly, mainly from a computational perspective. A result about the asynchronous automaticity of an HNN…
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…
The present paper constructs unbounded quasimorphisms that are invariant under all automorphisms on free products of more than two factors and on graph products of finitely generated abelian groups. This includes many classes of right…
We show that the set $SA(G)$ of equivalence classes of synchronously automatic structures on a geometrically finite hyperbolic group $G$ is dense in the product of the sets $SA(P)$ over all maximal parabolic subgroups $P$. The set $BSA(G)$…
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…
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 paper we study the hyperbolicity properties of a class of random groups arising as graph products associated to random graphs. Recall, that the construction of a graph product is a generalization of the constructions of right-angled…
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…
This article is dedicated to the study of the acylindrical hyperbolicity of automorphism groups of graph products of groups. Our main result is that, if $\Gamma$ is a finite graph which contains at least two vertices and is not a join and…
We study the automorphisms of graph products of cyclic groups, a class of groups that includes all right-angled Coxeter and right-angled Artin groups. We show that the group of automorphism generated by partial conjugations is itself a…
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…
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…
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 provide involutory symmetric generating sets of finitely generated Coxeter groups, fulfilling a suitable finiteness condition, which in particular is fulfilled in the finite, affine and compact hyperbolic cases.
We describe a general technique for embedding certain amalgamated products into direct products. This technique provides us with a way of constructing a host of finitely presented subgroups of automatic groups which are not even…
It is shown that certain ascending HNN extensions of free abelian groups of finite rank, as well as various lamplighter groups, can be realized as automaton groups, i.e., can be given a self-similar structure. This includes the solvable…
We use the description of the Schutzenberger automata for amalgams of finite inverse semigroups given by Cherubini, Meakin, Piochi to obtain structural results for such amalgams. Schutzenberger automata, in the case of amalgams of finite…
We give a complete characterization of the graph products of cyclic groups admitting a Polish group topology, and show that they are all realizable as the group of automorphisms of a countable structure. In particular, we characterize the…
A group $G$ is called automatically continuous if any homomorphism from a completely metrizable or locally compact Hausdorff group to $G$ has open kernel. In this paper, we study preservation of automatic continuity under group-theoretic…