Related papers: Conjugacy problem in groups with quadratic Dehn fu…

For a fixed $n\ge2$, the Houghton group $H_n$ consists of bijections of $X_n=\{1,\ldots,n\} \times \mathbb{N}$ that are `eventually translations' of each copy of $\mathbb{N}$. The Houghton groups have been shown to have solvable conjugacy…

On the one hand, it is well known that the only subquadratic Dehn function of finitely presented groups is the linear one. On the other hand there is a huge class of Dehn functions $d(n)$ with growth at least $n^4$ (essentially all possible…

We show the connection between the relative Dehn function of a finitely generated metabelian group and the distortion function of a corresponding subgroup in the wreath product of two free abelian groups of finite rank. Further, we show…

We prove that every finitely generated residually finite group $G$ can be embedded in a finitely generated branch group $\Gamma$ such that two elements in $G$ are conjugate in $G$ if and only if they are conjugate in $\Gamma$. As an…

We solve the twisted conjugacy problem on Thompson's group F. We also exhibit orbit undecidable subgroups of Aut(F), and give a proof that Aut(F) and Aut_+(F) are orbit decidable provided a certain conjecture on Thompson's group T is true.…

We prove foundational results for homological Dehn functions of groups of type $FP_2$ such as superadditivity and the invariance under quasi-isometry. We then study the homological Dehn functions of Leary's groups $G_L(S)$ providing methods…

We use the theory of group actions on profinite trees to prove that the fundamental group of a finite, 1-acylindrical graph of free groups with finitely generated edge groups is conjugacy separable. This has several applications: we prove…

The conjugator length function of a finitely generated group is the function $f$ so that $f(n)$ is the minimal upper bound on the length of a word realizing the conjugacy of two words of length at most $n$. We study herein the spectrum of…

Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…

We describe a constructive, cubic time solution to the conjugacy problem in Artin groups of extra-large type, which was proved solvable in those groups by Appel and Schupp. We use results from two of our previous papers that characterise…

We solve Dehn's isomorphism problem for virtually torsion-free relatively hyperbolic groups with nilpotent parabolic subgroups. We do so by reducing the isomorphism problem to three algorithmic problems in the parabolic subgroups, namely…

We prove that fundamental groups of non-orientable 3-manifolds have a solvable conjugacy problem, and construct an algorithm. Together with our earlier work on the conjugacy problem in groups on orientable geometrizable 3-manifolds, all…

We investigate the complexity of the conjugacy problem for fibre products in torsion-free hyperbolic groups. Let $G$ be a torsion-free hyperbolic group and let $P<G\times G$ be the fibre product associated to an epimorphism…

We establish a connection between the generalized conjugacy problem for a $G$-by-$\mathbb{Z}$ group, $GCP(G \rtimes \mathbb{Z})$, and two algorithmic problems for $G$: the generalized Brinkmann's conjugacy problem, $GBrCP(G)$, and the…

Weanalyzethecomputationalcomplexityofanalgorithmtosolve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most…

We prove that, for every integer $n \ge 2$, a finite or infinite countable group $G$ can be embedded into a 2-generated group $H$ in such a way that the solvability of quadratic equations of length at most $n$ is preserved, i.e., every…

We exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct products of hyperbolic groups, groups of…

We prove that the Bridson-Dison group has quartic Dehn function, thereby providing the first precise computation of the Dehn function of a subgroup of a direct product of free groups with super-quadratic Dehn function. We also prove that…

We generalize the classical Post correspondence problem ($\mathbf{PCP}_n$) and its non-homogeneous variation ($\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that…

An algorithm is constructed that, when given an explicit presentation of a finitely generated nilpotent group $G,$ decides for any pair of endomorphisms $\varphi, \psi : G \to G$ and any pair of elements $u, v \in G,$ whether or not the…