SearcharxivSearch

arXiv · 2608.17891

Thompson's Conjecture for Finite Simple Groups of Lie Type over Small Fields

Abstract

We prove that every finite simple group of Lie type over a field of order at most 8 contains a conjugacy class whose square is the whole group. Together with the previously established cases, our results complete the proof of Thompson's conjecture. We explicitly construct the required class, address all low-rank identifications, and provide the precise computational certificates used in the exceptional character calculations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jun Liao, Lizhong Wang, Jiping Zhang. 2026-08-18. Thompson's Conjecture for Finite Simple Groups of Lie Type over Small Fields. https://arxiv.org/abs/2608.17891

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