Related papers: Automatic Quotients of Free Groups

In this paper, we give an introduction to basic concepts of automaton semigroups. While we must note that this paper does not contain new results, it is focused on extended introduction in the subject and detailed examples.

We consider finite deterministic automata such that their alphabets consist of exactly one letter of defect 1 and a set of permutations of the state set. We study under which conditions such an automaton is completely reachable. We focus…

Let $G$ be a finitely generated group, $A$ a finite set of generators and $K$ a subgroup of $G$. We call the pair $(G,K)$ context-free if the set of all words over $A$ that reduce in $G$ to an element of $K$ is a context-free language. When…

Let G be a connected reductive affine algebraic group. In this short note we define the "variety of G-characters" of a finitely generated group F and show that the quotient of the G-character variety of F by the action of the trace…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

We study subsets $E$ of finitely generated groups where the set of all words over a given finite generating set that lie in $E$ forms a context-free language. We call these sets recognisably context-free. They are invariant of the choice of…

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…

We study the automorphism groups attached to a free algebra with multiple, possibly infinitely many, composition laws. As an application, we prove that the automorphism group of finitely generated vertex algebras over noetherian rings are…

A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This paper gives a systematic analysis of the properties…

Let $\Pi$ be the \'etale fundamental group of a smooth affine curve over an algebraically closed field of characteristic $p>0$. We establish a criterion for profinite freeness of closed subgroups of $\Pi$. Roughly speaking, if a closed…

The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to C-graph automatic by Murray Elder and the first author raise the question of whether Thompson's group F is graph automatic. We define…

We study the structures of Fourier coefficients of automorphic forms on symplectic groups based on their local and global structures related to Arthur parameters. This is a first step towards the general conjecture on the relation between…

In this article, we characterize the (covariant) isotropy groups of free, finitely generated racks and quandles. As a consequence, we show that the usual inner automorphisms of such racks and quandles are precisely those automorphisms that…

We describe the development of the theory of automatic groups. We begin with a historical introduction, define the concepts of automatic, biautomatic and combable groups, derive basic properties, then explain how hyperbolic groups and the…

An approach to identify the normal subgroups determined by ideals in free group rings with the help of the derived functors of non-additive functors is explored. A similar approach, i.e., via derived functors, for computing limits of…

A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…

We study random nilpotent groups in the well-established style of random groups, by choosing relators uniformly among freely reduced words of (nearly) equal length and letting the length tend to infinity. Whereas random groups are quotients…

We describe the groups of automorphisms of two generated free braided associative algebras with involutive diagonal braidings over a field of characteristic $\neq 2$. Depending on the form of the diagonal involutive braiding, five different…

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability…