Regular Suborbits in Permutation Groups

• Regular suborbits are defined as suborbits where the point-stabilizer acts semiregularly, crucial for forming bases of size two in primitive permutation groups.
• Their classification involves detailed case analyses in groups like PSL(2,q), linking combinatorial enumeration with geometric applications.
• Probabilistic techniques and fixed-point methods, such as the Q-bound, underpin the verification of the Burness–Giudici conjecture in these frameworks.

A regular suborbit is a fundamental notion in permutation group theory and algebraic combinatorics, formalizing “bases of size two” and their interaction in primitive actions of finite groups. Research over the last decade has developed the theory of regular suborbits extensively, especially in the context of the Burness–Giudici conjecture. This article synthesizes their precise definitions, characterization in various group actions, structural properties, methods of enumeration, and their combinatorial and geometric ramifications.

1. Definition and Basic Properties

Let $G$ be a finite transitive permutation group acting on the set $\Omega$, and fix a point $\alpha \in \Omega$. The suborbits of $G$ relative to $\alpha$ are the orbits of the point-stabilizer $G_\alpha$ on $\Omega$. For any $\beta\in\Omega$, the suborbit containing $\beta$ is given by

$\Delta(\beta)=\{\beta^h\mid h\in G_\alpha\}.$

A suborbit $\Delta$ is called regular if $G_\alpha$ acts regularly (semiregularly) on $\Delta$, i.e.,

$$|\Delta| = |G_\alpha|,\quad \text{or equivalently}\quad (G_\alpha)_\beta = \{1\}\;\forall\,\beta\in\Delta.$$

The union of all regular suborbits relative to $\alpha$ is denoted

$$\Gamma = \bigcup\{\Delta~|~\Delta\text{ is regular}\}.$$

These regular suborbits have tight connections to bases of size two for primitive actions: every pair $\{\alpha, \beta\}$ with $\beta \in \Delta$ for some regular suborbit $\Delta$ forms a base of size two since $G_{\alpha,\beta}=G_\alpha \cap G_\beta = \{1\}$ (Chen et al., 2020).

2. Role in the Burness–Giudici Conjecture

The pivotal conjecture formulated by Burness and Giudici asserts a robust intersection property for regular suborbits in the context of primitive permutation groups with minimal base size two (i.e., $b(G)=2$). Precisely,

$$\text{For every }g\in G \text{ with }\alpha^g \notin \Gamma,\ \Gamma \cap \Gamma^g \neq \emptyset,$$

where $\Gamma^g$ is the union of regular suborbits relative to $\alpha^g$ (Chen et al., 2020, Chen et al., 27 Dec 2025, Chen et al., 27 Dec 2025, Chen et al., 27 Dec 2025). This combinatorial property is equivalent, in the Saxl graph $\Sigma(G)$ (whose vertices are $\Omega$ and edges correspond to bases of size 2), to the statement that any two vertices have a common neighbor, i.e., $\Sigma(G)$ is strongly connected with diameter at most two (except for Frobenius groups, where the diameter is one).

3. Classification and Computation of Regular Suborbits

In classical group actions, the classification and enumeration of regular suborbits is highly nontrivial, demanding case analysis on maximal subgroups and leveraging structural group theory. For example, in $G = \mathrm{PSL}(2, q)$, the primitive actions on coset spaces $[G:M]$ are classified according to the maximal subgroups $M$:

• Parabolic: $Z_q : Z_{(q-1)/d}$ yields $2$-transitive actions, regular suborbits being all non-fixed points.
• Dihedral: $D_{2(q\pm1)/d}$, regular suborbits correspond to cosets whose point-stabilizer is not contained in $T \cap M$.
• Subfield: $\mathrm{PSL}(2, p^m)$ or $\mathrm{PGL}(2, p^m)$, regular suborbit counts are derived via combinatorial fixed-point formulas.
• Exceptional: $A_4$, $S_4$, $A_5$; structure determined by explicit calculation and probabilistic bounds (Chen et al., 2020).

In rank-one Lie type groups, the case-by-case analysis (see Table) is central:

Socle Type	Maximal Subgroup $M$	Regular Suborbit Existence
$\mathrm{PSL}(2,q)$	Parabolic, dihedral, subfield, exceptional	See above; explicit casework required
$\mathrm{PSU}(3,q)$	$PSO(3,q)$, subfield, exceptional	Case-dependent, geometric and Q-bound
$\mathrm{Sz}(q)$	Borel, Hall, automorphism types	Counting via Manning’s formula
$\mathrm{Ree}(q)$	Product types, maximal Ree subgroups	Probabilistic and fixed-point analysis

The formal enumeration of regular suborbit sizes can be expressed via stabilizer orders and double coset decomposition; see, for instance,

$$|\Delta| = \frac{|G_v|}{|\text{Stab}_{G_v}(\text{rep. of } \Delta)|}$$

for each suborbit representative (Li et al., 2011).

4. Structural and Combinatorial Properties

Regular suborbits encapsulate rich combinatorial structure, often manifesting as neighborhoods in the Saxl graph. In particular, for groups $G$ where $b(G) = 2$, the existence of regular suborbits implies that pairs form bases, and the union $\Gamma$ achieves maximal intersection properties per the Burness–Giudici conjecture.

Moreover, in association schemes arising from group actions, each relation class corresponds to a suborbit, and regular suborbits play a special role: their stabilizer is trivial, contributing maximum connectivity to the resultant graphs. For instance, the subconstituent graph $\Gamma_n^+$ of $O_{2n+1}(q)$, though having no nontrivial regular suborbits for $n \ge 2$, exhibits quasi-strongly regular parameters $(N, k, \lambda; \mu_i)$ computed explicitly in (Li et al., 2011).

Further, in some exceptional Lie type cases (e.g., Suzuki and Ree groups), regular suborbit counts are bounded below by $|\Omega|/2$, enabling intersection properties needed for the BG conjecture via elementary set-theoretic arguments (Chen et al., 27 Dec 2025).

5. Enumerative and Probabilistic Techniques

The verification of regular suborbit properties, especially in the context of the Burness–Giudici conjecture, leverages mass formulas, fixed-point ratios, and probabilistic criteria. The core technical tool is the “Q-bound,” which asserts: if

$$Q(G) := \sum_{H} \frac{(|H|-1) \cdot \text{Fix}_\Omega(H)}{|C_M(H)|} < \frac12,$$

then every two vertices in the Saxl graph have a common neighbor, and thus the BG-conjecture holds for the action. This method can be applied to various cases by explicit enumeration of prime-order subgroups and their fixed-point contributions (Chen et al., 27 Dec 2025, Chen et al., 27 Dec 2025).

In geometric settings, counting intersection points between special subplanes (Baer subplanes in unitary geometry for $\mathrm{PSU}(3,q)$, for example) and exploiting Weil’s bound for point counts on irreducible curves advances similar intersection conclusions (Chen et al., 27 Dec 2025).

6. Illustrative Cases and Limitations

Explicit examples underscore the ramifications:

• For $G = \mathrm{PSL}(2,p)$ with dihedral point-stabilizer $M \cong D_{2(p+1)}$, the set $\Gamma$ of regular suborbits comprises precisely all involutions outside $M$, and any pair of such involutions lies in a common dihedral subgroup, yielding a base (Chen et al., 2020).
• For $G = \mathrm{PSU}(3,7)$, two regular suborbits each of size $336$ exist in the action on $16856$ points, representing cosets corresponding to Baer subplanes in projective geometry (Chen et al., 27 Dec 2025).
• In orthogonal dual polar graphs ($O_{2n+1}(q)$ acting on the last subconstituent), closed-form orbit size formulas are available, yet—crucially—no nontrivial suborbit is regular for $n \ge 2$ and odd $q$ (Li et al., 2011). This demonstrates that not all actions of classical groups admit regular suborbits.

7. Extensions and Open Problems

The theory of regular suborbits is central not only for rank-one Lie-type groups but also motivates analogous investigations in higher rank and sporadic simple groups. Except for small finite families, the BG-conjecture is now fully resolved for all primitive permutation groups with socle a rank-one Lie-type group and $b(G)=2$ (Chen et al., 27 Dec 2025). Open research directions include the extension to classical groups of higher rank, affine groups with exotic stabilizers, and further exploration of association-scheme structure arising from group actions.

A plausible implication is that geometric techniques—such as those exploiting configurations of subspaces in unitary or symplectic settings—will continue to provide both conceptual and computational leverage for the detection and enumeration of regular suborbit structure in settings beyond rank-one. The probabilistic approach and Q-bound methods appear adaptable to broader classes of primitive actions. Regular suborbit theory is thus positioned as a linchpin for combinatorial and geometric advances across finite permutation group theory.