SearcharxivSearch

arXiv · 2512.22456

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

Abstract

Let $G$ be a transitive permutation group on $\Omega$ with two points $\alpha, \beta\in\Omega$ such that $G_{\alpha}\cap G_{\beta}=1$. The Saxl graph $\Sigma(G)$ of the pair $(G,\Omega)$ is the graph with vertex set $\Omega$, while two vertices $\alpha', \beta'$ are adjacent if and only if $G_{\alpha'}\cap G_{\beta'}=1$. It was conjectured by Burness and Giudici that the Saxl graph $\Sigma(G)$ of any primitive permutation group $G$ has the property that any two vertices have a common neighbor. We focused on proving the conjecture for all primitive groups $G$ whose socle is a simple group of Lie-type of rank $1$, that is, those with $soc(G)\in \{PSL(2,q), PSU(3,q), Ree(q), Sz(q)\}$. The case of $soc(G)=PSL(2,q)$ has been published in two papers. This paper will address most cases where $soc(G)=PSU(3,q)$, with the exception of a particularly intricate configuration in which the point stabilizer contains $PSO(3,q)$. That specific configuration has been treated in a separate paper.

Explore related subjects

Keep this discovery

BibTeXRIS

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

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