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 hyperbolic group from F. Haglund’s and D. Wise’s version of Rips’s construction is hereditarily conjugacy separable. We then use this construction to produce firs...

We analyze the computational complexity of 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 exponential. For a subfamily of groups we prove that the conjugacy search problem is polynomial. We also show that for some of these groups the conjugacy search problem reduces t...

By algebraic group theory, there is a map from the semisimple conjugacy classes of a nite group of Lie type to the conjugacy classes of the Weyl group. Picking a semisimple class uniformly at random yields a probability measure on conjugacy classes of the Weyl group. We conjecture that this measure agrees with a second measure on conjugacy classes of the Weyl group induced by a construction of ...

We prove the Arad–Herzog conjecture for various families of finite simple groups — if A and B are nontrivial conjugacy classes, then AB is not a conjugacy class. We also prove that if G is a finite simple group of Lie type and A and B are nontrivial conjugacy classes, either both semisimple or both unipotent, then AB is not a conjugacy class. We also prove a strong version of the Arad–Herzog co...

3.3. The greatest common divisor and the least common multiple 12 3.4. Parabolic divisors 14 3.5. Divisibility: further properties 14 4. Normal forms arising from HNN extensions 16 4.1. HNN -normal form 16 5. Conjugacy problem 18 5.1. Conjugacy Criterion for HNN -extensions 18 5.2. Block decomposition 22 5.3. Conjugacy with respect to a subgroup 23 5.4. An algorithm for solving the Conjugacy Pr...

‎Let $G $ be a finite group and $X$ be a conjugacy class of $G.$ The‎ ‎rank of $X$ in $G,$ denoted by $rank(G{:}X),$ is defined to‎ ‎be the minimal number of elements of $X$ generating $G.$ In this‎ ‎paper we establish the ranks of all the conjugacy classes of‎ ‎elements for simple alternating group $A_{10}$ using the structure‎ ‎constants method and other results established in‎ ‎[A.B.M‎. ‎Bas...

Let S be a semigroup. The elements a, b ∈ S are called primarily conjugate if a = xy and b = yx for certain x, y ∈ S. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case when S is a monoid, denote by G the group of units of S. Then the relation of G-conjugacy is defined by a ∼G b ⇐⇒ a = gbg for certain g ∈ G. We establish the structur...

We consider several computational problems related to conjugacy between subshifts of finite type, restricted k -block codes: verifying a proposed conjugacy, deciding if two shifts admit and reducing the representation size shift via conjugacy. give polynomial-time algorithm for verification, show GI - NP -hardness size, respectively. Our approach focuses on 1-block conjugacies vertex shifts, fr...