Related papers: Recognition and constructive membership for purely…

It is shown that in various categories, including many consisting of maps or hypermaps, oriented or unoriented, of a given hyperbolic type, every countable group $A$ is isomorphic to the automorphism group of uncountably many non-isomorphic…

We prove groups acting cocompactly on locally finite trees with hyperbolic vertex stabilisers are asynchronously automatic. Combining this with previous work of the authors, we obtain an example of a group satisfying several non-positive…

We describe an algorithm for deciding whether or not a given finitely generated torsion-free nilpotent group is decomposable as the direct product of nontrivial subgroups.

We study the average case complexity of the uniform membership problem for subgroups of free groups, and we show that it is orders of magnitude smaller than the worst case complexity of the best known algorithms. This applies to subgroups…

We construct examples of finitely generated groups L that have non-trivial actions on $\mathbb{R}$-trees but which cannot act, without fixing a vertex, on any simplicial tree. Moreover, any finitely presented group mapping onto L does have…

The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to…

Let G be a finitely generated relatively hyperbolic group. We show that if no peripheral subgroup of G is hyperbolic relative to a collection of proper subgroups, then the fixed subgroup of every automorphism of G is relatively quasiconvex.…

Let $G$ be a hyperbolic group that splits as a graph of free groups with cyclic edge groups. We prove that, unless $G$ is isomorphic to a free product of free and surface groups, every finite abelian group $M$ appears as a direct summand in…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

We construct finitely generated groups with strong fixed point properties. Let $\mathcal{X}_{ac}$ be the class of Hausdorff spaces of finite covering dimension which are mod-$p$ acyclic for at least one prime $p$. We produce the first…

We give a criterion for a set of $n$ hyperbolic isometries of a $\mathrm{CAT}(0)$ metric space $X$ to generate a free group on $n$ generators. This extends a result by Alperin, Farb and Noskov who proved this for 2 generators under the…

We introduce the notion of the $k$-closure of a group of automorphisms of a locally finite tree, and give several examples of the construction. We show that the $k$-closure satisfies a new property of automorphism groups of trees that…

We use Gersten's generalization of Whitehead's algorithm to determine whether a given finitely generated subgroup of a free group $F$ is elliptic in an elementary cyclic splitting of $F$. We provide a similar result for all elementary…

Given data, finding a faithful low-dimensional hyperbolic embedding of the data is a key method by which we can extract hierarchical information or learn representative geometric features of the data. In this paper, we explore a new method…

We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in…

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

We prove that if $L=\mbox{}^2F_4(2^{2n+1})'$ and $x$ is a nonidentity automorphism of $L$ then $G=\langle L,x\rangle$ has four elements conjugate to $x$ that generate $G$. This result is used to study the following conjecture about the…

We consider the class of countable groups possessing an action on a finite product of hyperbolic graphs where every infinite order element acts loxodromically. When the graphs are locally finite, we obtain strong structure theorems for the…

Decision trees and models that use them as primitives are workhorses of machine learning in Euclidean spaces. Recent work has further extended these models to the Lorentz model of hyperbolic space by replacing axis-parallel hyperplanes with…