Related papers: The generalised word problem in hyperbolic and rel…

We prove that the class of finitely presented inverse monoids whose Sch\"utzenberger graphs are quasi-isometric to trees has a uniformly solvable word problem, furthermore, the languages of their Sch\"utzenberger automata are context-free.…

A finitely generated group $G$ is called poly-context-free if its word problem $\mathrm{WP}(G)$ is an intersection of finitely many context-free languages. We consider the quaternionic lattices $\Gamma_\tau$ over the field…

For any finitely generated, non-elementary, torsion-free group $G$ that is hyperbolic relative to $\mathbb P$, we show that there exists a group $G^*$ containing $G$ such that $G^*$ is hyperbolic relative to $\mathbb P$ and $G$ is not…

We give a characterization of toral relatively hyperbolic virtually special groups in terms of the profinite completion. We also prove a Tits alternative for subgroups of the profinite completion $\hat G$ of a relatively hyperbolic…

In 2006 Z. Sela and independently O. Kharlampovich and A. Myasnikov gave a solution to the Tarski problems by showing that two non-abelian free groups have the same elementary theory. Subsequently Z. Sela generalized the techniques used in…

A theorem of Myasnikov and Roman'kov says that any verbally closed subgroup of a finitely generated free group is a retract. We prove that all free (and many virtually free) verbally closed subgroups are retracts in any finitely generated…

We give a new, effective proof of the separability of cubically convex-cocompact subgroups of special groups. As a consequence, we show that if $G$ is a virtually compact special hyperbolic group, and $Q\leq G$ is a $K$-quasiconvex…

We generalize a well known periodicity lemma from the case of free groups to the case of acylindrically hyperbolic groups. This generalization will be used later to describe solutions of certain equations in acylindrically hyperbolic groups…

Let $\Phi:F\rightarrow F$ be an automorphism of the finite-rank free group $F$. Suppose that $G=F\rtimes_\Phi\mathbb Z$ is word-hyperbolic. Then $G$ acts freely and cocompactly on a CAT(0) cube complex.

We build quasi--isometry invariants of relatively hyperbolic groups which detect the hyperbolic parts of the group; these are variations of the stable dimension constructions previously introduced by the authors. We prove that, given any…

We prove the Borel Conjecture for a class of groups containing word-hyperbolic groups and groups acting properly, isometrically and cocompactly on a finite dimensional CAT(0)-space.

In this note, we provide a (super-exponential time) algorithm to solve the generalized conjugacy problem in relatively hyperbolic groups, given solvability of the generalized conjugacy problem in each of the parabolic subgroups.

Let $G$ be a non-elementary hyperbolic group. Let $w$ be a group word such that the set $w[G]$ of all its values in $G$ does not coincide with $G$ or 1. We show that the width of verbal subgroup $w(G)=<w[G]>$ is infinite. That is, there is…

We show that every virtually torsion-free subgroup of the outer automorphism group of a conjugacy separable relatively hyperbolic group is residually finite. As a direct consequence, we obtain that the outer automorphism group of a limit…

The study of verbal subgroups within a group is well-known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance.…

Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…

We show that the full set of solutions to systems of equations and inequations in a hyperbolic group, as shortlex geodesic words (or any regular set of quasigeodesic normal forms), is an EDT0L language whose specification can be computed in…

A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…

In this paper we explore the connections between the class of Visibly Pushdown Languages ($\mathbf{VPL}$) and the natural sets of words one can associate to a finitely generated group. We show that the word problem of a finitely generated…

We show that the universal theory of torsion groups is strongly contained in the universal theory of finite groups. This answers a question of Dyson. We also prove that the universal theory of some natural classes of torsion groups is…