Related papers: Automatic Quotients of Free Groups

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

Let A be a finite alphabet and let L contained in (A*)^n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an…

In this paper, we study the topological structure of a universal construction related to quasitopological groups: the free quasitopological group $F_q(X)$ on a space $X$. We show that free quasitopological groups may be constructed directly…

We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite…

We show that infinitely many alternating groups arise as quotients of the free group of rank 2, with kernel a characteristic subgroup. We also show that such simple quotients exist of arbitrarily large Lie rank. This resolves two questions…

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…

Surface groups are determined among limit groups by their profinite completions. As a corollary, the set of surface words in a free group is closed in the profinite topology.

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…

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…

The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.

Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…

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…

Factors $\frac{X}{Y}$ in a free group $F$ with $Y$ normal in $X$ are considered. Precise results on the free structure of ${Y}$ relative to the free structure of ${X}$ when $\frac{X}{Y}$ is abelian are obtained. Some extensions and…

Let $\mathcal F=(F, +. \cdot, <, 0, 1, \dots)$ be a definably complete locally o-minimal expansion of an ordered field. We demonstrate the existence of definable quotients of definable sets by definable equivalence relations when several…

Anisimov and Seifert show that a group has a regular word problem ifand only if it is finite. Muller and Schupp (together with Dunwoody's accessibility result) show that a group has context free word problem if and only if it is virtually…

The group ring of the automorphism group of a p-group is studied using the automorphism groups of subgroups and quotient groups of P.

We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…

There exist f.g.-universal cellular automata groups which are quotients of $\mathbb{Z} * \mathbb{Z}_2$ or $\mathbb{Z}_2 * \mathbb{Z}_2 * \mathbb{Z}_2$, as previously conjectured by the author.

We describe a group theoretic condition which ensures that any cellular action of a group satisfying this condition on a CAT(0) cube complex has a global fixed point. In particular, we show that this fixed point criterion is satisfied by…

In this paper, we introduce the notion of strongly automatic semigroup, which implies the usual notion of auto- maticity. We focus on semigroups of \beta-adics developpements, for which we obtain a criterion of strong automaticity.