SearcharxivSearch

arXiv · 2512.22459

The Burness-Giudici Conjecture on Primitive Groups with Socle PSU(3,q)

Abstract

Let $G$ be a transitive permutation group on a set $\Omega$, and suppose $G_{\alpha}\cap G_{\beta}=1$ for some distinct $\alpha, \beta\in\Omega$. The Saxl graph $\Sigma(G)$ of $(G, \Omega)$ is defined as the graph with vertex set $\Omega$, where two vertices $\alpha', \beta'$ are adjacent if and only if $G_{\alpha'}\cap G_{\beta'}=1$. Burness and Giudici conjectured that for every primitive permutation group $G$, its Saxl graph has the property that any two vertices share a common neighbor. We focus on proving the conjecture for all primitive groups $G$ whose socle is a simple group of Lie-type of rank $1$; that is, $soc(G)\in \{PSL(2,q),PSU(3,q), Ree(q),Sz(q)\}$. The case $soc(G)=PSL(2,q)$ has been treated in two earlier papers. The purpose of the present paper is to settle the case $soc(G)=PSU(3,q)$. To finsh this work, we draw on methods from abstract- and permutation- group theory, finite unitary geometry, probabilistic approach, number theory (employing Weil's bound), and, most importantly, algebraic combinatorics, which provides us some key ideas.

Explore related subjects

Keep this discovery

BibTeXRIS

Huye Chen, Shaofei Du, Weicong Li. 2025-12-27. The Burness-Giudici Conjecture on Primitive Groups with Socle PSU(3,q). https://arxiv.org/abs/2512.22459

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