相关论文: Conjugacy classes of solutions to equations and in…

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…

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…

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,…

If $G_1$ and $G_2$ are torsion-free hyperbolic groups and $P<G_1\times G_2$ is a finitely generated subdirect product, then the conjugacy problem in $P$ is solvable if and only if there is a uniform algorithm to decide membership of the…

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 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…

Let $G$ be a group. Two elements $x, y$ are said to be {\it $z$-equivalent} if their centralizers are conjugate in $G$. The class equation of $G$ is the partition of $G$ into conjugacy classes. Further decomposition of conjugacy classes…

We give an algorithm for solving equations and inequations with rational constraints in virtually free groups. Our algorithm is based on Rips classification of measured band complexes. Using canonical representatives, we deduce an algorithm…

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 give a reduction of the conjugacy problem among outer automorphisms of free (and torsion-free hyperbolic) groups to specific algorithmic problems pertaining to mapping tori of polynomially growing automorphisms. We explain how to use…

For $\Gamma$ a cocompact or cofinite Fuchsian group, we study the hyperbolic lattice point problem in conjugacy classes, which is a modification of the classical hyperbolic lattice point problem. We use large sieve inequalities for the…

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 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…

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

A new method for the Lie group classification of differential equations is proposed. It is based of the determination of all possible cases of linear dependence of certain indeterminate appearing in the determining equations of symmetries…

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 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.…

In this work we investigate tensor completions of groups by associative rings, which were introduced by R.Lyndon and G.Baumslag in 1960s. The main result states that there exists an algorithm that decides if a given finite system of…

We construct a hyperbolic group with a finitely presented subgroup, which has infinitely many conjugacy classes of finite-order elements. We also use a version of Morse theory with high dimensional horizontal cells and use handle…

Modelled on efficient algorithms for solving the conjugacy problem in hyperbolic groups, we define and study the permutation conjugacy length function. This function estimates the length of a short conjugator between words $u$ and $v$, up…