SearcharxivSearch

arXiv · 1806.01938

Fusion systems with Benson-Solomon components

Abstract

The Benson-Solomon systems comprise a one-parameter family of simple exotic fusion systems at the prime $2$. The results we prove give significant additional evidence that these are the only simple exotic $2$-fusion systems, as conjectured by Solomon. We consider a saturated fusion system $\mathcal{F}$ having an involution centralizer with a component $\mathcal{C}$ isomorphic to a Benson-Solomon fusion system, and we show under rather general hypotheses that $\mathcal{F}$ cannot be simple. Furthermore, we prove that if $\mathcal{F}$ is almost simple with these properties, then $\mathcal{F}$ is isomorphic to the next larger Benson-Solomon system extended by a group of field automorphisms. Our results are situated within Aschbacher's program to provide a new proof of a major part of the classification of finite simple groups via fusion systems. One of the most important steps in this program is a proof of Walter's Theorem for fusion systems, and our first result is specifically tailored for use in the proof of that step. We then apply Walter's Theorem to treat the general Benson-Solomon component problem under the assumption that each component of an involution centralizer in $\mathcal{F}$ is on the list of currently known quasisimple $2$-fusion systems.

Explore related subjects

Keep this discovery

BibTeXRIS

Ellen Henke, Justin Lynd. 2018-06-05. Fusion systems with Benson-Solomon components. https://doi.org/10.1215/00127094-2021-0031

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