Related papers: On groups with EDT0L word problem

In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…

A word $w$ is said to be concise in a class of groups if, for every $G$ in that class such that the set of $w$-values $w\{G\}$ is finite, the verbal subgroup $w(G)$ is also finite. In the context of profinite groups, the notion of strong…

Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…

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.

Let $G$ be a group. Then $S\subseteq G$ is an invariable generating set of $G$ if every subset $S'$ obtained from $S$ by replacing each element with a conjugate is also a generating set of $G$. We investigate invariable generation among key…

This note studies the Burnside problem for homeomorphism groups of compact connected manifolds. For surfaces, we prove that the identity component of the homeomorphism group is torsion-free precisely when the surface is not the sphere,…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

We show that the generation problem in Thompson group $F$ is decidable, i.e., there is an algorithm which decides if a finite set of elements of $F$ generates the whole $F$. The algorithm makes use of the Stallings $2$-core of subgroups of…

The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.

We are interested in the subgroup membership problem in groups acting on rooted $d$-regular trees and a natural class of subgroups, the stabilisers of infinite rays emanating from the root. These rays, which can also be viewed as infinite…

We study Farrell Nil-groups associated to a finite order automorphism of a ring $R$. We show that any such Farrell Nil-group is either trivial, or infinitely generated (as an abelian group). Building on this first result, we then show that…

In this note, we classify all finite groups having exactly 6, 7 or 8 cyclic subgroups. This gives a partial answer to the open problem posed by Tarnauceanu (Amer. Math. Monthly, 122 (2015), 275-276). As a consequence of our results, we also…

We analyze the proof by Lehnert and Schweitzer that the word problem of the Thompson group V is co-context-free, and we show that this word problem is the complement of the cyclic closure of a union of reverse deterministic context-free…

We construct first examples of infinite finitely generated residually finite torsion groups with positive rank gradient. In particular, these groups are non-amenable. Some applications to problems about cost and $L^2$-Betti numbers are…

We prove several Littlewood-Offord type inequalities for arbitrary groups. In groups having elements of finite order the worst case scenario is provided by the simple random walk on a certain cyclic subgroup. The inequalities we obtain are…

If $\G$ is a finitely generated group with generators $\{g_1,...,g_j\}$ then an infinite order element $f \in \G$ is a {\em distortion element} of $\G$ provided $\displaystyle{\liminf_{n \to \infty} |f^n|/n = 0,}$ where $|f^n|$ is the word…

We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finitely generated groups and torsion-free abelian groups of…

We show that every finite simple group is generated invariably by a Sylow subgroup and a cyclic group. It follows that that the order complex of the coset poset of an arbitrary finite group has nontrivial reduced rational homology.

In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…

We prove that torsion subgroups of groups defined by C(6), C(4)-T(4) or C(3)-T(6) small cancellation presentations are finite cyclic groups. This follows from a more general result on the existence of fixed points for locally elliptic…