Related papers: Recognition and constructive membership for purely…

We prove an acylindrical accessibility theorem for finitely generated groups acting on $\mathbf R$-trees. Namely, we show that if $G$ is a freely indecomposable non-cyclic $k$-generated group acting minimally and $M$-acylindrically on an…

This paper is the first of a sequence of three papers, where the concept of an $\mathbb R$-tree dual to a measured geodesic lamination in a hyperbolic surface is generalized to arbitrary $\mathbb R$-trees provided with a (very small) action…

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

We show that, if $H$ is a random subgroup of a finitely generated free group $F_k$, only inner automorphisms of $F_k$ may leave $H$ invariant. A similar result holds for random subgroups of toral relatively hyperbolic groups, more generally…

We describe an algorithm which determines whether or not a group which is hyperbolic relative to abelian groups admits a nontrivial splitting over a finite group.

We develop a notion of groups that act acylindrically and non-elementarily on simplicial trees, which we call acylindrically arboreal groups. We then prove a complete classification of when graph products of groups and the fundamental…

Given a finitely generated subgroup $H$ of a free group $F$, we present an algorithm which computes $g_1,\ldots,g_m\in F$, such that the set of elements $g\in F$, for which there exists a non-trivial $H$-equation having $g$ as a solution,…

Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…

In this article, we prove that any complex smooth rational surface $X$ which has no automorphism of positive entropy has a finite number of real forms (this is especially the case if $X$ cannot be obtained by blowing up $\mathbb…

A finitely generated group is lacunary hyperbolic if one of its asymptotic cones is an $\mathbb{R}$-tree. In this article we give a necessary and sufficient condition on lacunary hyperbolic groups in order to be stable under free product by…

We establish sufficient conditions for the C$^*$-simplicity of two classes of groups. The first class is that of groups acting on trees, such as amalgamated free products, HNN-extensions, and their normal subgroups; for example normal…

Let $\Lambda$ be an ordered abelian group, $\mathrm{Aut}^+(\Lambda)$ the group of order-preserving automorphisms of $\Lambda$, $G$ a group and $\alpha:G\to\mathrm{Aut}^+(\Lambda)$ a homomorphism. An $\alpha$-affine action of $G$ on a…

We prove that ascending HNN extensions of free groups are word-hyperbolic if and only if they have no Baumslag-Solitar subgroups. This extends the theorem of Brinkmann that free-by-cyclic groups are word-hyperbolic if and only if they have…

We show that, given a finitely generated group $G$ as the coordinate group of a finite system of equations over a torsion-free hyperbolic group $\Gamma$, there is an algorithm which constructs a cover of a canonical solution diagram. The…

Let $H$ be a torsion-free $\delta$-hyperbolic group with respect to a finite generating set $S$. Let $a_1,..., a_n$ and $a_{1*},..., a_{n*}$ be elements of $H$ such that $a_{i*}$ is conjugate to $a_i$ for each $i=1,..., n$. Then, there is a…

We provide an effective algorithm for determining whether an element of the outer automorphism group of a free group is fully irreducible. Our method produces a finite list which can be checked for periodic proper free factors.

We prove that an automorphism $\phi:F\to F$ of a finitely generated free group $F$ is hyperbolic in the sense of Gromov if it has no nontrivial periodic conjugacy classes.

This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Z^n-trees give one a powerful tool to…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…