SearcharxivSearch

arXiv · 2608.17878

Total 3-closure for projective special linear groups

Abstract

A finite group is totally $3$-closed if every faithful permutation representation of it is $3$-closed. We study this property for the finite simple projective special linear groups. We prove that $\PSL_2(q)$ is totally $3$-closed if and only if $q\geq 7$ is prime, and that $\PSL_3(q)$ is totally $3$-closed if and only if either $q=3$, or $q$ is prime and $q\equiv 2\pmod 3$. We further prove that $\PSL_4(q)$ is never totally $3$-closed and that $\PSL_n(q)$ is not totally $3$-closed whenever $n\geq 5$ and $q>2$. Within the family $\PSL_n(q)$, only the groups $\PSL_n(2)$ with $n\geq 5$ remain unresolved. In particular, this answers Problem~20.2 of the Kourovka Notebook affirmatively.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ting Gong, Yong Yang, Michael Ruofan Zeng. 2026-08-18. Total 3-closure for projective special linear groups. https://arxiv.org/abs/2608.17878

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