Related papers: Automaton groups and complete square complexes

We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…

We prove that each nonpositively curved square VH-complex can be turned functorially into a locally 6-large simplicial complex of the same homotopy type. It follows that any group acting geometrically on a CAT(0) square VH-complex is…

In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…

We expand the class of groups with relatively geometric actions on CAT(0) cube complexes by proving that it is closed under $C'(\frac16)$--small cancellation free products. We build upon a result of Martin and Steenbock who prove an…

If $G$ is a finitely generated group and $X$ is a Cayley graph of $G$, denote by $\mathcal{C}_1^X(G)$ the subgroup of all automorphisms of $X$ commensurating $G$ and fixing the vertex corresponding to the identity. Building on the work of…

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 study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…

We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…

We study automaton groups without singular points, that is, points in the boundary for which the map that associates to each point its stabilizer, is not continuous. This is motivated by the problem of finding examples of infinite…

We prove that if a subgroup $H$ of the automorphism group $\mathrm{Aut}(\Sigma^{\mathbb{Z}})$ of a non-trivial full shift acts on points of finite support with a free orbit, then for every finitely-generated abelian group $A$, the abstract…

Motivated by a question of Bumagin and Wise, we construct a continuum of finitely generated, residually finite groups whose outer automorphism groups are pairwise non-isomorphic finitely generated, non-recursively-presentable groups. These…

We give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then we consider groups generated by the dual…

We prove that the group of reversible cellular automata (RCA), on any alphabet $A$, contains a subgroup generated by three involutions which contains an isomorphic copy of every finitely generated group of RCA on any alphabet $B$. This…

Antonenko and Russyev independently have shown that any Mealy automaton with no cycles with exit--that is, where every cycle in the underlying directed graph is a sink component--generates a fi- nite (semi)group, regardless of the choice of…

We study groups acting on CAT(0) square complexes. In particular we show if Y is a nonpositively curved (in the sense of A. D. Alexandrov) finite square complex and the vertex links of Y contain no simple loop consisting of five edges, then…

Let $G$ be a finite non-cyclic, non-characteristically simple group with the property that all proper characteristic subgroups of $G$ are cyclic. We call such a group $\mathrm{CCS}$ group, short for \emph{Characteristic Cyclic}. In this…

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…

Quadric complexes are square complexes satisfying a certain combinatorial nonpositive curvature condition. These complexes generalize 2-dimensional CAT(0) cube complexes and are a square analog of systolic complexes. We introduce and study…

The aim of the article is to show that there are many finite extensions of arithmetic groups which are not residually finite. Suppose $G$ is a simple algebraic group over the rational numbers satisfying both strong approximation, and the…

We characterize which groups splitting as finite graphs of free groups with cyclic edge groups are residually finite. Such a group $G$ is residually finite if and only if all its Baumslag-Solitar subgroups are residually finite. From a…