Related papers: The generalised word problem for subgroups of hype…

We establish combinatorial characterizations of virtually torsion-free and virtually free groups using the canonical graph decomposition theory in \cite{DJKK22}. Our main results show that a finitely presented, residually finite group…

We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…

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…

For a subgroup of a free product of finite groups, we obtain necessary conditions (on its Kurosh decomposition) to be verbally closed.

The 1973 Boone-Higman conjecture predicts that every finitely generated group with solvable word problem embeds in a finitely presented simple group. In this paper, we show that hyperbolic groups satisfy this conjecture, that is, each…

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.

Let $\Gamma$ be a torsion-free hyperbolic group. We study $\Gamma$--limit groups which, unlike the fundamental case in which $\Gamma$ is free, may not be finitely presentable or geometrically tractable. We define model $\Gamma$--limit…

This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…

We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of…

We prove that for any finitely generated relatively hyperbolic group G and any symmetric endomorphism f of G with relatively quasiconvex image, Fixf is relatively quasiconvex subgroup of G.

We prove that the mapping torus of a graph immersion has a word-hyperbolic fundamental group if and only if the corresponding endomorphism does not produce Baumslag-Solitar subgroups. Due to a result by Reynolds, this theorem applies to all…

We give a complete classification of finitely generated virtually free groups up to $\forall\exists$-elementary equivalence. As a corollary, we give an algorithm that takes as input two finite presentations of virtually free groups, and…

A word hyperbolic group $G$ is called GFERF if every quasiconvex subgroup coincides with the intersection of finite index subgroups containing it. We show that in any such group, the product of finitely many quasiconvex subgroups is closed…

We prove that a subset of a virtually free group is rational if and only if the language of geodesic words representing its elements (in any generating set) is rational and that the language of geodesics representing conjugates of elements…

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…

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 give a necessary and sufficient condition for the fundamental group of a finite graph of groups with infinite cyclic edge groups to be acylindrically hyperbolic, from which it follows that a finitely generated group splitting over Z…

In this paper, we present a notion of quasiconvexity in the setting of finitely-generated groups with hyperbolically embedded subgroups. Our main result shows that this notion yields uniform quasiconvex constants in the setting of coned-off…

In this work we investigate tensor completions of groups by associative rings, which were introduced by R.Lyndon and G.Baumslag in 1960s. The main result states that there exists an algorithm that decides if a given finite system of…

We show that a construction by Aanderaa and Cohen used in their proof of the Higman Embedding Theorem preserves torsion length. We give a new construction showing that every finitely presented group is the quotient of some $C'(1/6)$…