Related papers: Time complexity of the conjugacy problem in relati…

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…

Let $G$ be a real semisimple Lie group with trivial centre and no compact factors. Given a conjugate pair of either real hyperbolic elements or unipotent elements $a$ and $b$ in $G$ we find a conjugating element $g \in G$ such that…

It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed…

We study the word and conjugacy problems in lacunary hyperbolic groups (briefly, LHG). In particular, we describe a necessary and sufficient condition for decidability of the word problem in LHG. Then, based on the graded small-cancellation…

The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…

Determining the length of short conjugators in a group can be considered as an effective version of the conjugacy problem. The conjugacy length function provides a measure for these lengths. We study the behaviour of conjugacy length…

This arXived paper has two independant parts, that are improved and corrected versions of different parts of a single paper once named "On equations in relatively hyperbolic groups". The first part is entitled "Existential questions in…

We construct a class of finitely generated groups which have arbitrarily large conjugacy separability function, but in which the conjugacy problem can be solved in polynomial time, demonstrating that the McKinsey algorithm for the conjugacy…

In this paper we study the complexity of solving quadratic equations in the lamplighter group. We give a complete classification of cases (depending on genus and other characteristics of a given equation) when the problem is…

We compute conjugacy classes in maximal parabolic subgroups of the general linear group. This computation proceeds by reducing to a ``matrix problem''. Such problems involve finding normal forms for matrices under a specified set of row and…

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…

Let $G$ be an acylindrically hyperbolic group and $E$ an exponential equation over $G$. We show that if $E$ is solvable in $G$, then there exists a solution whose components, corresponding to loxodromic elements, can be linearly estimated…

We prove a formula connecting the number of unipotent conjugacy classes in a maximal parabolic subgroup of a finite general linear group with the numbers of unipotent conjugacy classes in various parabolic subgroups in smaller dimensions.…

The Baumslag group had been a candidate for a group with an extremely difficult word problem until Myasnikov, Ushakov, and Won succeeded to show that its word problem can be solved in polynomial time. Their result used the newly developed…

We present an algorithm for solving the conjugacy search problem in the four strand braid group. The computational complexity is cubic with respect to the braid length.

Several key agreement protocols are based on the following "Generalized Conjugacy Search Problem": Find, given elements b_1,...,b_n and xb_1x^{-1},...,xb_nx^{-1} in a nonabelian group G, the conjugator x. In the case of subgroups of the…

A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We prove that the multiple conjugacy problem is solvable between two n-tuples A and B of…

Parabolic cut pairs in the boundaries of relatively hyperbolic group are a new and previously unexplored phenomenon. In this paper, we give a way to create examples of relatively hyperbolic groups with parabolic cut pairs on their boundary…

We describe an effective version of the conjugacy problem and study it for wreath products and free solvable groups. The problem involves estimating the length of short conjugators between two elements of the group, a notion which leads to…

The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…