SearcharxivSearch

arXiv · 2305.09008

Criteria for supersolvability of saturated fusion systems

Abstract

Let $p$ be a prime number. A saturated fusion system $\mathcal{F}$ on a finite $p$-group $S$ is said to be supersolvable if there is a series $1 = S_0 \le S_1 \le \dots \le S_m = S$ of subgroups of $S$ such that $S_i$ is strongly $\mathcal{F}$-closed for all $0 \le i \le m$ and such that $S_{i+1}/S_i$ is cyclic for all $0 \le i < m$. We prove some criteria that ensure that a saturated fusion system $\mathcal{F}$ on a finite $p$-group $S$ is supersolvable provided that certain subgroups of $S$ are abelian and weakly $\mathcal{F}$-closed. Our results can be regarded as generalizations of purely group-theoretic results of Asaad.

Explore related subjects

Keep this discovery

BibTeXRIS

Fawaz Aseeri, Julian Kaspczyk. 2023-05-15. Criteria for supersolvability of saturated fusion systems. https://arxiv.org/abs/2305.09008

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