Related papers: Long relators in groups generated by two parabolic…

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…

A group obtained from a nontrivial group by adding one generator and one relator which is a proper power of a word in which the exponent-sum of the additional generator is one contains the free square of the initial group and almost always…

We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…

We consider largeness of groups given by a presentation of deficiency 1, where the group is respectively free-by-cyclic, LERF or 1-relator. We give the first examples of (finitely generated free)-by-(infinite cyclic) word hyperbolic groups…

A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…

We isolate a tractable class of HNN-extensions of a free group, namely, multiple HNN-extensions by basis-conjugating embeddings. For this class, we construct a normal form and establish a practical version of the ping-pong lemma that…

We adapt the Ping-Pong Lemma, which historically was used to study free products of groups, to the setting of the homeomorphism group of the unit interval. As a consequence, we isolate a large class of generating sets for subgroups of…

We investigate translation length functions for two-generated groups acting by isometries on $\Lambda$-trees, where $\Lambda$ is a totally ordered abelian group. In this context, we provide an explicit formula for the translation length of…

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…

Adding two generators and one arbitrary relator to a nontrivial torsion-free group, we always obtain an SQ-universal group. In the course of the proof of this theorem, we obtain some other results of independent interest. For instance,…

We consider the cyclically presented groups defined by cyclic presentations with $2m$ generators $x_i$ whose relators are the $2m$ positive length three relators $x_ix_{i+1}x_{i+m-1}$. We show that they are hyperbolic if and only if $m\in…

A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to…

We introduce two families of two-generator one-relator groups called primitive extension groups and show that a one-relator group is hyperbolic if its primitive extension subgroups are hyperbolic. This reduces the problem of characterising…

In this paper we study a group G which is the quotient of a free product of three non-trivial groups by the normal closure of a single element. In particular we show that if the relator has length at most eight, then G is non-trivial. In…

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…

The research described in this note aims at solving the constructive membership problem for the class of quasisimple classical groups. Our algorithms are developed in the black-box group model; that is, they do not require specific…

We define two impartial games, the Relator Achievement Game $\texttt{REL}$ and the Relator Avoidance Game $\texttt{RAV}$. Given a finite group $G$ and generating set $S$, both games begin with the empty word. Two players form a word in $S$…

We prove that with probability tending to 1, a 1-relator group with at least 3 generators and relator of length n is residually finite, virtually residually (finite p)-group for all sufficiently large p, and coherent. The proof uses both…

We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…

The statement ``no nonabelian simple group can be obtained from a nonsimple group by adding one generator and one relator" 1) is equivalent to the Kervaire--Laudenbach conjecture; 2) becomes true under the additional assumption that the…