For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable conjugacy problem. Moreover G and H have the same r.e. Turing degrees of the conjugacy problem. This solves a problem by D. Collins.

We survey known results concerning how the conjugacy classes contained in a normal subgroup and their sizes exert an influence on the normal structure of a finite group. The approach is mainly presented in the framework of graphs associated to the conjugacy classes, which have been introduced and developed in the past few years. We will see how the properties of these graphs, along with some ex...

In this paper we prove that a free product of conjugacy separable groups A and B, amalgamating a cyclic subgroup, is conjugacy separable if A and B are subgroup separable, cyclic conjugacy separable, 2-free, and residually p-finite, for all prime numbers p. The following result is an example of the applications we obtain as consequences of our main theorem. Let A and B each be a free product of...

(A) We study in this paper topological properties of conjugacy classes in Polish groups. There are two questions which we are particularly interested in. First, does a Polish group G have a dense conjugacy class? This is equivalent (see, e.g., Kechris [95, 8.47]) to the following generic ergodicity property of G: Every conjugacy invariant subset A ⊆ G with the Baire property (e.g., a Borel set)...

By algebraic group theory, there is a map from the semisimple conjugacy classes of a finite 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 o...

The conjugacy problem and the inverse conjugacy problem of a finitely generated group are defined, from a language theoretic point of view, as sets of pairs of words. An automaton might be obliged to read the two input words synchronously, or could have the option to read asynchronously. Hence each class of languages gives rise to four classes of groups; groups whose (inverse) conjugacy problem...

Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is the quantum separability problem. In Section 1, I begin with a brief introduction to separability and entanglement, and a basic formal definition of the quan...

Random walk on the chambers of hyperplanes arrangements is used to de ne a family of card shu ing measuresMW;x for a nite Coxeter group W and real x 6= 0. By algebraic group theory, there is a map from the semisimple orbits of the adjoint action of a nite group of Lie type on its Lie algebra to the conjugacy classes of the Weyl group. Choosing such a semisimple orbit uniformly at random thereby...

Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. Since then, there have been several attempts to break the braid cryptosystem by solving the conjugacy problem in braid groups. In this paper, we first survey all the major attacks on the braid cryptosystem and conclude that the ...

Abstract. Let SL(2, q) be the group of 2× 2 matrices with determinant one over a finite field F of size q. We prove that if q is even, then the product of any two noncentral conjugacy classes of SL(2, q) is the union of at least q − 1 distinct conjugacy classes of SL(2, q). On the other hand, if q > 3 is odd, then the product of any two noncentral conjugacy classes of SL(2, q) is the union of a...