SearcharxivSearch

arXiv · 2402.18373

Factorizations of Almost Simple Groups with Applications

Abstract

The classification of factorizations $G=HK$ of finite almost simple groups, proposed by Wielandt in 1979 and pursued through several partial classifications, has remained open in one major case. We settle that case: for every finite almost simple classical group $G$, we determine all factorizations $G=HK$ in which both $H$ and $K$ have a unique nonsolvable composition factor, completing the classification of factorizations of finite almost simple groups. Among other consequences of this classification, we prove that the smallest dimension of a biperfect bicrossproduct Hopf algebra is $41287680$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert M. Guralnick, Cai Heng Li, Lei Wang, Binzhou Xia. 2024-02-28. Factorizations of Almost Simple Groups with Applications. https://arxiv.org/abs/2402.18373

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