Related papers: Reduced, tame and exotic fusion systems

We prove, when $S$ is a $2$-group of order at most $2^9$, that each reduced fusion system over $S$ is the fusion system of a finite simple group and is tame. It then follows that each saturated fusion system over a $2$-group of order at…

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…

We say that a fusion system is the composition product of two subsystems if every morphism can be factored as a morphism in one fusion system followed by a morphism in the other. We establish a relationship between the characteristic…

A saturated fusion system over a finite $p$-group $S$ is a category whose objects are the subgroups of $S$ and whose morphisms are injective homomorphisms between the subgroups satisfying certain axioms. A fusion system over $S$ is realized…

In this article we prove that for any saturated fusion system, that the (unique) smallest weakly normal subsystem of it on a given strongly closed subgroup is actually normal. This has a variety of corollaries, such as the statement that…

We show that every (not necessarily saturated) fusion system can be realized as a full subcategory of the fusion system of a finite group. This result extends our previous work \cite{Park2010} and complements the related result…

For $S$ a Sylow $p$-subgroup of the group $\mathrm{G}_2(p)$ for $p$ odd, up to isomorphism of fusion systems, we determine all saturated fusion systems $\mathcal{F}$ on $S$ with $O_p(\mathcal{F})=1$. For $p \ne 7$, all such fusion systems…

We define a `tree of fusion systems' and give a sufficient condition for its completion to be saturated. We apply this result to enlarge an arbitrary fusion system by extending the automorphism groups of certain of its subgroups.

In this article, we consider the control of fusion in fusion systems, proving three previously known, non-trivial results in a new, largely elementary way. We then reprove a result of Aschbacher, that the product of two strongly closed…

Let $p$ be an odd prime, and let $S$ be a $p$-group with a unique elementary abelian subgroup $A$ of index $p$. We classify the simple fusion systems over all such groups $S$ in which $A$ is essential. The resulting list, which depends on…

The Benson-Solomon systems comprise the only known family of simple saturated fusion systems at the prime two that do not arise as the fusion system of any finite group. We determine the automorphism groups and the possible almost simple…

For $p\in\{2,3\}$ it is known that a saturated $p$-fusion system is realizable if and only if each of its components is realizable by a finite simple group. For primes $p\geq 5$ this is false. Building on work of Broto, M{\o}ller, Oliver…

The theory of saturated fusion systems resembles in many parts the theory of finite groups. However, some concepts from finite group theory are difficult to translate to fusion systems. For example, products of normal subsystems with other…

We determine for which known finite simple groups $G$ and which primes $p$ the $p$-fusion system of $G$ is simple. This means first collecting together the results that were already known (and correcting two errors made in an earlier study…

We determine, for $p$ odd, all saturated fusion systems on a Sylow $p$-subgroup $S$ of the unitary group $SU_4(p)$ and we prove that they are all realizable by finite groups. In particular, we prove that $S$ does not support any exotic…

Linking systems were introduced to provide algebraic models for $p$-completed classifying spaces of fusion systems. Every linking system over a saturated fusion system $\mathcal{F}$ corresponds to a group-like structure called a locality.…

For a prime $p$, we describe a protocol for handling a specific type of fusion system on a $p$-group by computer. These fusion systems contain all saturated fusion systems. This framework allows us to computationally determine whether or…

We complete the determination of saturated fusion systems on maximal class 3-groups of rank two.

We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…

We study saturated fusion systems on $p$-groups having sectional rank $3$ for all odd primes $p$. For $p\geq 5$, we obtain a complete classification of the ones that do not have any non-trivial normal $p$-subgroups.