Sparse fusion systems
classification
🧮 math.GR
math.RT
keywords
systemsfusionsparseconstraineddefineprimessaturatedtheorem
read the original abstract
We define sparse saturated fusion systems and show that, for odd primes, sparse systems are constrained. This simplifies the proof of the Glauberman-Thompson p-nilpotency theorem for fusion systems and a related theorem of Stellmacher. We then define a more restrictive class of saturated fusion systems, called extremely sparse, that are constrained for all primes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.