相关论文: On the conjugacy problem for subdirect products of…

In this paper we study conjugacy separability of subdirect products of two free (or hyperbolic) groups. We establish necessary and sufficient criteria and apply them to fibre products to produce a finitely presented group $G_1$ in which all…

We study conjugacy classes of solutions to systems of equations and inequations over torsion-free hyperbolic groups, and describe an algorithm to recognize whether or not there are finitely many conjugacy classes of solutions to such a…

Suppose that a finitely generated group $G$ is hyperbolic relative to a collection of subgroups $\mathbb{P}=\{P_1,\dots,P_m\}$. Let $H_1,H_2$ be subgroups of $G$ such that $H_1$ is relatively quasiconvex with respect to $\mathbb{P}$ and…

A finitely generated subgroup H of a torsion-free hyperbolic group G is called immutable if there are only finitely many conjugacy classes of injections of H into G. We show that there is no uniform algorithm to recognize immutability,…

We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…

Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…

We investigate which free constructions (amalgamated products and HNN-extensions) over word hyperbolic groups produce groups that are again word hyperbolic. A complete answer is obtained for the case when the amalgamated subgroups are…

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…

Let N be a finitely generated normal subgroup of a Gromov hyperbolic group G. We establish criteria for N to have solvable conjugacy problem and be conjugacy separable in terms of the corresponding properties of G/N. We show that 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…

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.

We obtain a number of finiteness results for groups acting on Gromov-hyperbolic spaces. In particular we show that a torsion-free locally quasiconvex hyperbolic group has only finitely many conjugacy classes of $n$-generated one-ended…

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…

In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups $G_n$ whose conjugacy problem is at least as hard as the subset sum problem with $n$ indeterminates. As such, the…

A group $G$ is called subgroup conjugacy separable if for every pair of non-conjugate finitely generated subgroups of $G$, there exists a finite quotient of $G$ where the images of these subgroups are not conjugate. It is proved that the…

In this paper we consider the {\em conjugacy stability} property of subgroups and provide effective procedures to solve the problem in several classes of groups. In particular, we start with free groups, that is, we give an effective…

If $u$ and $v$ are two conjugate elements of a hyperbolic group then the length of a shortest conjugating element for $u$ and $v$ can be bounded by a linear function of the sum of their lengths, as was proved by Lysenok. Bridson and…

Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group $G$ is the following decision problem: given a tuple $(g, g_1, \ldots, g_k)$ of…

Solvability of the conjugacy problem for relatively hyperbolic groups was announced by Gromov [Hyperbolic groups, MSRI publications 8 (1987)]. Using the definition of Farb of a relatively hyperbolic group in the strong sense [B Farb,…

We exhibit examples of finitely presented subgroups $P$ of direct products of hyperbolic groups for which there is no algorithm that detects whether a finitely presented group has a quotient isomorphic to $P$. For any torsion-free, linear,…