Related papers: Centralizers and conjugacy classes in finite class…

We classify the factorizations of finite classical groups with nonsolvable factors, completing the classification of factorizations of finite almost simple groups.

In this paper, we study the action of finite subgroups of the mapping class group of a surface on the curve complex. We prove that if the diameter of the almost fixed point set of a finite subgroup H is big enough, then the centralizer of H…

Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis…

We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness…

We give characterizations of the center, of conjugated and of commuting elements in a fundamental group of a graph of group. We deduce various results : on the one hand we give a sufficient condition for the center, the centralizers, and…

A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.

Let G be a group. Two elements x,y are said to be in the same z-class if their centralizers are conjugate in G. Let V be a vector space of dimension n over a field F of characteristic different from 2. Let B be a non-degenerate symmetric,…

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…

For the finite groups GU(3), SU(3), GL(3), SL(3) over a finite field we solve the class product problem, i.e., we give a complete list of $m$-tuples of conjugacy classes whose product does not contain the identity matrix.

In this paper, we study the structure of finite groups with a large number of conjugacy classes of $p$-elements for some prime $p$. As consequences, we obtain some new criteria for the existence of normal $p$-complements in finite groups.

We describe the topological behavior of the conjugacy action of the mapping class group of an orientable infinite-type surface $\Sigma$ on itself. Our main results are: (1) All conjugacy classes of $MCG(\Sigma)$ are meager for every…

Let $\Gamma$ be a torsion free discrete group acting cocompactly on a two dimensional euclidean building $\Delta$. The centralizer of an element of $\Gamma$ is either a Bieberbach group or is described by a finite graph of finite cyclic…

We continue the investigation, that began in [3] and [4], into finite groups whose set of nontrivial conjugacy class sizes form an arithmetic progression. Let $G$ be a finite group and denote the set of conjugacy class sizes of $G$ by ${\rm…

The goal of this paper is to characterization generalized Alexander quandles of finite groups in the language of the underlying groups. Firstly, we prove that if finite groups $G$ are simple, then the quandle isomorphic classes of…

We describe the computation of class groups and unit groups of number fields as implemented in Magma (V2.29). After quickly reviewing the main algorithms based on factor bases, relation collection, and analytic class number evaluation, we…

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

We estimate the proportion of several classes of elements in finite classical groups which are readily recognised algorithmically, and for which some power has a large fixed point subspace and acts irreducibly on a complement of it. The…

Let $\Gamma$ be a finitely generated cocompact lattice of a totally disconnected locally compact group $G$, and $C$ a dense subgroup of $G$ that contains and commensurates $\Gamma$. We study the problem of describing all finitely generated…

We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conugacy problem given by the authors in a previous paper, are two…

This paper addresses various questions about pairs of similarity classes of matrices which contain commuting elements. In the case of matrices over finite fields, we show that the problem of determining such pairs reduces to a question…