Primitive Permutation Groups with Dihedral Stabilizers

• The paper presents a classification framework for primitive permutation groups with dihedral point stabilizers using extensions of the Aschbacher–O’Nan–Scott theorem.
• Methodologies include subgroup structure analysis, explicit computations, and arithmetic constraints to differentiate finite affine and almost-simple cases.
• Results impact the design of symmetric block structures and enhance understanding of maximal subgroup conditions and automorphism actions.

A primitive permutation group with dihedral point stabilizer is a group $G \leq \mathrm{Sym}(\Omega)$ acting transitively and primitively on a set $\Omega$ such that the stabilizer $G_x$ of a point $x$ is isomorphic to a dihedral group $D_{2n}$ of order $2n$. The classification of such groups encompasses both infinite and finite cases and reveals a rich interplay between group structures, automorphism actions, and maximal subgroup conditions. Primitivity entails that $G_x$ is a maximal subgroup of $G$, and the dihedral property constrains the possibilities for $G$ substantially, as shown in foundational results extending the Aschbacher–O’Nan–Scott theorem and subsequent refinements.

1. Dihedral Groups and Point Stabilizers

Let $$D_n = \langle r,s\mid r^n=1,\ s^2=1,\ srs=r^{-1}\rangle$$ denote the dihedral group of order $2n$. In the context of primitive permutation groups, $G_x\cong D_{2n}$ means that every nontrivial stabilizer is a finite dihedral group. The dihedral structure implies that $G_x$ is solvable and imposes arithmetic constraints on the parameters of $G$, especially in the finite case. The primitivity condition requires that $G_x$ be maximal in $G$ and acts transitively on the coset space $G/G_x = \Omega$.

2. Infinite Primitive Groups: The Aschbacher–O’Nan–Scott–Smith Framework

Simon Smith provides a comprehensive extension of the Aschbacher–O’Nan–Scott theorem to infinite primitive $G$ with finite point stabilizer $G_a\cong D_n$ (Smith, 2011). Every such $G$ admits a unique minimal normal subgroup $M = K_1 \times\dots\times K_m$, where each $K_i$ is simple, infinite, nonabelian, and finitely generated. The action of $G$ falls into three types:

1. Type (i) Regular-Simple (“Split Extension”):
   • $M\cong K$ is simple and acts regularly; $G=K\rtimes D_n$ with $D_n$ acting faithfully on $K$ via outer automorphisms.
   • Primitivity requires that $K$ has no proper nontrivial $D_n$-invariant subgroups.
2. Type (ii) Almost-Simple, Non-Regular:
   • $M\cong K$ is simple, $M$ is of finite index in $G$, and $M\leq G\leq \mathrm{Aut}(K)$.
   • $D_n$ embeds as a maximal finite subgroup of $\mathrm{Aut}(K)$, with $M\cap D_n$ a nontrivial finite subgroup.
3. Type (iii) Product Action (“Wreath-Type”):
   • $M = K_1 \times\dots\times K_m$, $m > 1$, with $D_n$ permuting factors transitively.
   • $G$ embeds into $H\wr \mathrm{Sym}(m)$, where $H$ is an infinite primitive group with dihedral stabilizer.
   • The product action is primitive if $H$ is primitive but not regular and $m$ is finite.

The three types correspond to the “affine-like” (split extension), “almost-simple,” and “wreath product” cases in the extended O’Nan–Scott typology. Concrete instances utilize Obraztsov’s embedding theorem to realize $K$ with a prescribed $D_n$-action (Smith, 2011).

3. Finite Primitive Groups: Explicit Classification

The finite case is classified in detail in recent work (Chen et al., 13 Jan 2026), where the main theorem (Theorem 2.1) establishes that for a finite primitive $G \leq \mathrm{Sym}(\Omega)$ with $G_x\cong D_{2n}$, one of two situations holds:

• The socle of $G$, denoted $\mathrm{Soc}(G)$, is elementary abelian, so $G$ is of affine type.
• $\mathrm{Soc}(G) = T$ is nonabelian simple, and the pair $(G,G_x)$ appears in Table 1.

The table below lists all almost-simple primitive groups with dihedral point stabilizer, with the necessary order formulas and arithmetic conditions.

Table: Almost-Simple Primitive Groups with Dihedral Stabilizer

$G$	$\mathrm{Soc}(G)$	$G_x\cong D_{2n}$
$A_5$	$A_5$	$D_6,\ D_{10}$
$S_5$	$A_5$	$D_{12}$
$\mathrm{PSL}(2,q)$	$\mathrm{PSL}(2,q)$	$D_{2(q+1)/d},\ D_{2(q-1)/d}$
		$D_{10}$ ($q=5$)
$\mathrm{PGL}(2,q)$	$\mathrm{PSL}(2,q)$	$D_{2(q+1)},\ D_{2(q-1)}$
$\mathrm{PSL}(2,7).2$	$\mathrm{PSL}(2,7)$	$D_{12},\ D_{16}$
${}^2G_2(3)'$	${}^2G_2(3)'$	$D_{14},\ D_{18}$

Here, $d=(2,q-1)$; arithmetic restrictions include $q\neq 7,9$ for some cases and $q$ odd for $\mathrm{PGL}(2,q)$. No other simple groups occur as socles in such primitive groups. The order $|\Omega|=|G:G_x|$ is specified by the respective indices.

4. Product, Wreath, and Affine Constructions

For $m>1$, the classification extends to “wreath-type” actions, where $G\leq H\wr \mathrm{Sym}(m)$ acts primitively on $A^m$, provided that $H$ itself is primitive with dihedral stabilizer and $D_n$ acts transitively on the $m$ direct factors. The necessary permutation action of $D_n$ may be realized via dihedral symmetries of an $m$-gon (i.e., $m|n$ or $m=n$) or a flip action when $m=2$.

The affine case corresponds to $G$ with elementary abelian socle and maximal subgroup $D_{2n}$. In this situation, the permutation domain is the coset space of the socle, and $G$ acts as a split extension.

5. Arithmetic and Subgroup Restrictions

Arithmetic constraints play a central role in determining which groups admit dihedral maximal subgroups acting primitively. For $\mathrm{PSL}(2,q)$:

• $G_x = D_{2(q+1)/d}$ is permitted iff $q\neq 7,9$.
• $G_x = D_{2(q-1)/d}$ is permitted iff $q\neq 5,7,9,11$.

For $\mathrm{PGL}(2,q)$, $q$ must be odd, with the same dihedral subgroups. The small extra cases involving $A_5$, $\mathrm{PSL}(2,7).2$, and ${}^2G_2(3)'$ are treated by direct computation of primitivity degrees and subgroup embeddings.

A plausible implication is that in symmetric block designs with dihedral local action, point and block stabilizers $G_x$ and $G_B$ are conjugate in $G$, and both local actions are faithful (Chen et al., 13 Jan 2026).

6. Proof Strategy and Structural Significance

The classification leverages the extended O’Nan–Scott framework, first ruling out the product-action, diagonal, and twisted-wreath cases (where the socle–stabilizer cannot be dihedral), via detailed subgroup structure analyses (see Lemmas 2.3–2.4 of (Chen et al., 13 Jan 2026)). The almost-simple case is resolved by examining lists of maximal subgroups in classical simple groups (Dickson’s classification, Giudici’s tables), supplemented by explicit calculations for small $q$ and exceptional groups (Lemmas 2.5–2.6).

This synthesis elucidates the restrictive nature of dihedral stabilizers in primitive groups, connecting automorphism group structure, subgroup maximality, and primitive action criteria. The results have direct applications to locally transitive block designs with dihedral local action, further highlighting the interplay between permutation group theory and design theory.

7. Applications and Further Directions

Primitive permutation groups with dihedral point stabilizers feature in classification of symmetric block designs with locally dihedral automorphism groups and in the construction of groups with prescribed maximal subgroups. The explicit forms enable detailed analysis of automorphism-induced actions in combinatorial structures, the enumeration of designs with maximal symmetry, and the study of infinite simple group actions with prescribed stabilizer structure.

The connection between block designs and permutation group primitivity suggests future avenues in the synthesis of locally dihedral combinatorial configurations and in the exploration of infinite group actions with solvable maximal subgroups, tracing further structural parallels between abstract group theory and discrete geometry (Chen et al., 13 Jan 2026, Smith, 2011).