Related papers: Carter subgroups of finite groups

We give a description of a finite group whose maximal subgroups possess only soluble proper subgroups, which implies the answer to the well-known question on composition factors of finite groups, whose second maximal subgroups are soluble.

It is proved that every finitely generated profinite group with fewer than $2^{\aleph_0}$ conjugacy classes of elements of infinite order is finite

We classify all finite groups G such that the product of any two non-inverse conjugacy classes of G is always a conjugacy class of G. We also classify all finite groups G for which the product of any two G-conjugacy classes which are not…

We announce an atlas of subgroup lattices of almost simple groups and present two algorithms that were used to produce the atlas.

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

This paper reviews recent results and open problems on the conductor of finite group characters, highlighting their connections to one another and to broader topics in the representation theory of finite groups.

Computations in the cohomology of finite groups.

In this paper, we determine the finite groups with a Sylow $r$-subgroup contained in a unique maximal subgroup. The proof involves a reduction to almost simple groups, and our main theorem extends earlier work of Aschbacher in the special…

We develop a structure theory of connected solvable spherical subgroups in semisimple algebraic groups. Based on this theory, we obtain an explicit classification of all such subgroups up to conjugation.

We give the classification of elements - respectively cyclic subgroups - of finite order of the Cremona group, up to conjugation. Natural parametrisations of conjugacy classes, related to fixed curves of positive genus, are provided.

We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

We prove that every finitely generated soluble group which is not virtually abelian has a subgroup of one of a small number of types.

We prove that, except for a few cases, stable linearizability of finite subgroups of the plane Cremona group implies linearizability.

We show that the subgroup lattice of any finite group satisfies Frankl's Union-Closed Conjecture. We show the same for all lattices with a modular coatom, a family which includes all supersolvable and dually semimodular lattices. A common…

We give an example of a finitely presented simple group containing a finitely generated subgroup which is not finitely presented.

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

The spectrum of a finite group is the set of element orders of this group. The main goal of this paper is to survey results concerning recognition of finite simple groups by spectrum, in particular, to list all finite simple groups for…

Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…

For a finite group G, we denote by v(G) the number of conjugacy classes of subgroups of G not in CD(G). In this paper, we determine the finite groups G such that v(G)=1,2,3.