SearcharxivSearch

arXiv · 1604.05681

Automorphisms of fusion systems of sporadic simple groups

Abstract

We prove here that with a very small number of exceptions, when $G$ is a sporadic simple group and $p$ is a prime such that the Sylow $p$-subgroups of $G$ are nonabelian, then $Out(G)$ is isomorphic to the outer automorphism groups of the fusion and linking systems of $G$. In particular, the $p$-fusion system of $G$ is tame in the sense of [AOV1], and is tamely realized by $G$ itself except when $G\cong M_{11}$ and $p=2$. From the point of view of homotopy theory, these results also imply that $Out(G)\cong Out(BG^\wedge_p)$ in many (but not all) cases.

Explore related subjects

Keep this discovery

BibTeXRIS

Bob Oliver. 2016-04-19. Automorphisms of fusion systems of sporadic simple groups. https://arxiv.org/abs/1604.05681

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