๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Maximal Subgroups of Symmetric Groups

โœ Scribed by Martin W. Liebeck; Aner Shalev


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
348 KB
Volume
75
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

โœฆ Synopsis


We show that S n has at most n 6ร‚11+o(1) conjugacy classes of primitive maximal subgroups. This improves an n c log 3 n bound given by Babai. We conclude that the number of conjugacy classes of maximal subgroups of S n is of the form ( 12 +o(1))n. It also follows that, for large n, S n has less than n ! maximal subgroups. This confirms a special case of a conjecture of Wall. Improving a recent result from [MSh], we also show that any finite almost simple group has at most n 17ร‚11+o(1) maximal subgroups of index n.


๐Ÿ“œ SIMILAR VOLUMES


Symmetrical Subgroups of Artin Groups
โœ John Crisp ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 208 KB

We show that the subgroup fixed by a group of symmetries of an Artin system (A, S) is itself an Artin group under the hypothesis that the Deligne complex associated to A admits a suitable CAT(0) metric. Such a metric is known to exist for all Artin groups of type FC, which include all the finite typ

c-Sections of Maximal Subgroups of Finit
โœ Yanming Wang; Li Shirong ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 88 KB

Let G be a finite group and let M be a maximal subgroup of G. Let K/L be a chief factor of G such that L โ‰ค M and G = MK. We call the group M โˆฉ K/L a c-section of M in G. All c-sections of M are isomorphic. Using the concept of c-sections, we obtain some new characterizations of solvable and ฯ€-solvab

Conjugacy Classes in Maximal Parabolic S
โœ Scott H. Murray ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 184 KB

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 column operations. We solve the relevant matrix problem in sm