Related papers: Automatic structures for torus link groups
A Garside monoid is a cancellative monoid with a finite lattice generating set; a Garside group is the group of fractions of a Garside monoid. The family of Garside groups contains the Artin-Tits groups of spherical type. We generalise the…
We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…
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 study subgroups of Thompson's group $F$ by means of an automaton associated with them. We prove that every maximal subgroup of $F$ of infinite index is closed, that is, it coincides with the subgroup of $F$ accepted by the automaton…
Perepechko and Zaidenberg conjectured that the neutral component of the automorphism group of a rigid affine variety is a torus. We prove this conjecture for toric varieties and varieties with a torus action of complexity one. We also…
We classify all group topologies coarser than the topology of stabilizers of finite sets in the case of automorphism groups of countable free-homogeneous structures, Urysohn space and Urysohn sphere, among other related results.
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 provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…
Let G be a free group in a variety of groups, but G is not absolutely free. We prove that the group of automorphisms Aut(G) is linear iff G is a virtually nilpotent group.
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a regular set of words, and the interpretation of the…
Equipped with the operation of setwise multiplication induced by a (multiplicatively written) monoid $H$ on its parts, the collection of all finite subsets of $H$ containing the identity element is itself a monoid, denoted by $\mathcal…
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…
The main results of this paper is to give a complete characterization of the automaticity of one-relator semigroups with length less than or equal to three. Let $S=sgp\langle A|u=v\rangle$ be a semigroup generated by a set…
We discuss the set of subgroups of the automorphism group of a full shift, and submonoids of its endomorphism monoid. We prove closure under direct products in the monoid case, and free products in the group case. We also show that the…
We give sufficient conditions for a subgroup of a tree almost automorphism group to be isomorphic to the topological full groups of a one-sided shift in the sense of Matui. As an application, we show that almost automorphism groups of trees…
We give a formula relating the topological rank of the full group of an aperiodic pmp equivalence relation to the cost of its ergodic components. Furthermore, we obtain examples of full groups having a dense free subgroup whose rank is…
This paper studies automatic structures for subsemigroups of Baumslag--Solitar semigroups (that is, semigroups presented by $\ < x,y \mid (yx^m, x^ny)\ >$, where $m$ and $n$ are natural numbers). A geometric argument (a rarity in the field…
We show that the higher rank lamplighter groups, or Diestel-Leader groups $\Gamma_d(q)$ for $d \geq 3$, are graph automatic. This introduces a new family of graph automatic groups which are not automatic.
Takahasi's theorem on chains of subgroups of bounded rank in a free group is generalized to several classes of semigroups. As an application, it is proved that the subsemigroups of periodic points are finitely generated and periodic orbits…
We describe the main questions connected to torsion subgroups in the unit group of integral group rings of finite groups and algorithmic methods to attack these questions. We then prove the Zassenhaus Conjecture for Amitsur groups and prove…