SearcharxivSearch

arXiv · 1106.3760

Automorphism groups of sporadic groups

Abstract

Among the simplest invariants of the sporadic finite simple groups are their outer automorphism groups. For 12 of the 26 possible isomorphism types of a sporadic simple group G, the outer automorphism group Out(G) has order 2, and in the remaining 14 cases, Out(G) is trivial. Historically the suspicion of the existence of a sporadic group was followed in fairly short order by the calculation of a good upper bound on the size of its outer automorphism group. In a few cases establishing the existence of certain outer automorphisms, like the existence of the groups themselves, presented difficulties overcome only with the use of machine computation. In any case these calculations can be difficult to track down in the literature. This note, which contains nothing new, is only intended to bring together these calculations. It also answers a question of Bob Oliver about the automorphism groups of some of these groups, how they might be calculated, and specifically whether the Sylow 2-subgroups of a sporadic simple group are self-centralizing in the automorphism group of the simple group. The answer is that they are.

Explore related subjects

Keep this discovery

BibTeXRIS

Richard Lyons. 2011-06-19. Automorphism groups of sporadic groups. https://arxiv.org/abs/1106.3760

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR