SearcharxivSearch

arXiv · 2505.16375

Realizability of fusion systems by discrete groups: II

Abstract

We compare four different types of realizability for saturated fusion systems over discrete $p$-toral groups. For example, when $G$ is a locally finite group all of whose $p$-subgroups are artinian (hence discrete $p$-toral), we show that it has ``weakly Sylow'' $p$-subgroups and give explicit constructions of saturated fusion systems and associated linking systems associated to $G$. We also show that a fusion system over a discrete $p$-toral group $S$ is saturated if its set of morphisms is closed under a certain topology and the finite subgroups of $S$ satisfy the saturation axioms, and prove a version of the Cartan-Eilenberg stable elements theorem for locally finite groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Carles Broto, Ran Levi, Bob Oliver. 2025-05-22. Realizability of fusion systems by discrete groups: II. https://arxiv.org/abs/2505.16375

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