Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1710.07088

Fusion systems containing pearls

Valentina Grazian
View original source ↗Read source document ↗Export metadata ↓

Abstract

An $\mathcal{F}$-essential subgroup is called a pearl if it is either elementary abelian of order $p^2$ or non-abelian of order $p^3$. In this paper we start the investigation of fusion systems containing pearls: we determine a bound for the order of $p$-groups containing pearls and we classify the saturated fusion systems on $p$-groups containing pearls and having sectional rank at most $4$.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Valentina Grazian. 2017-10-19. Fusion systems containing pearls. https://arxiv.org/abs/1710.07088

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗