Simplicity of fusion systems of finite simple groups
Bob Oliver, Albert Ruiz

TL;DR
This paper classifies when the $p$-fusion systems of known finite simple groups are simple, correcting past errors and introducing new tools for analyzing saturated fusion systems.
Contribution
It provides a comprehensive classification of simple $p$-fusion systems of finite simple groups and develops new methods for analyzing saturated fusion systems.
Findings
Identifies primes for which the fusion system of each simple group is simple.
Corrects previous errors in the classification of fusion systems.
Introduces new tools for studying $O^{p'}()$ in saturated fusion systems.
Abstract
We determine for which known finite simple groups and which primes the -fusion system of is simple. This means first collecting together the results that were already known (and correcting two errors made in an earlier study of this question), and then handling the remaining cases. At the same time, we develop some new tools to use when determining for arbitrary saturated fusion systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Limits and Structures in Graph Theory
