An Infinite Family of Primitive Groups of Twisted Wreath Type Attaining the Upper Bound for the Minimal Subdegree

Let G be a finite primitive permutation group of twisted wreath type, with socle T^k and primitive component H. Giudici, Li, Praeger, Seress and Trofimov (2006) proved that the least non-trivial subdegree of G satisfies MinSubDeg(G) ≤ k · MinSubDeg(H), and asked whether this inequality is always strict (their Question 1.6; Question 4 of Praeger and Seress in Oberwolfach Report 12/2005). An earlier note of the author gave a negative answer with the group PSL(2,4) twr PGL(3,4). Here we show that the bound is attained by an infinite family. For a prime power q ≥ 4 let P = PGL(3,q) act on the k = q^2 + q + 1 points of the projective plane PG(2,q), let Q be the stabiliser of a point y, and let Q act on T = PSL(2,q) by conjugation, through its action on the quotient space F_q^3/y. Then G_q = T twr P is primitive of twisted wreath type, and MinSubDeg(G_q) = k · MinSubDeg(H) = q(q^3 − 1)(q + 1)/c_q, where c_q is q + 1, 2(q − 1) or 2(q + 1) according as q is even, q ≡ 1 or q ≡ 3 (mod 4). By the reduction of the five authors this is a statement about the subgroups of PGL(3,q) of order greater than q^2(q − 1)c_q. We prove it for q ≥ 5 by a written argument from the list of the maximal subgroups of SL(3,q) (Mitchell; Hartley; tabulated by Bray, Holt and Roney-Dougal), Dickson's list of the subgroups of PGL(2,q) and an inverse-transpose duality; for q = 4 it is the result of the earlier note. Exhaustive computations for small q, with independently written programs, are tests and not part of the proof. No infinite family attaining the bound was found in the literature accessible to us; a search that finds nothing is not a proof of novelty. This is an unrefereed note. Unrefereed preprint released for independent mathematical scrutiny. Publication on Zenodo does not constitute peer review. AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text. Corpus identifier: OWR-793-006 (Praeger–Seress, On minimal subdegrees of finite primitive permutation groups, Oberwolfach Report 12/2005, Question 4; second note, after doi:10.5281/zenodo.23299864).

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-14
DOI
https://doi.org/10.5281/zenodo.23366612
Primary Topic
Finite Group Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

An Infinite Family of Primitive Groups of Twisted Wreath Type Attaining the Upper Bound for the Minimal Subdegree

Alper Ferudun
Zenodo (CERN European Organization for Nuclear Research)
Finite Group Theory Research
preprint

An Infinite Family of Primitive Groups of Twisted Wreath Type Attaining the Upper Bound for the Minimal Subdegree

Alper Ferudun
preprint en

Abstract

Let G be a finite primitive permutation group of twisted wreath type, with socle T^k and primitive component H. Giudici, Li, Praeger, Seress and Trofimov (2006) proved that the least non-trivial subdegree of G satisfies MinSubDeg(G) ≤ k · MinSubDeg(H), and asked whether this inequality is always strict (their Question 1.6; Question 4 of Praeger and Seress in Oberwolfach Report 12/2005). An earlier note of the author gave a negative answer with the group PSL(2,4) twr PGL(3,4). Here we show that the bound is attained by an infinite family. For a prime power q ≥ 4 let P = PGL(3,q) act on the k = q^2 + q + 1 points of the projective plane PG(2,q), let Q be the stabiliser of a point y, and let Q act on T = PSL(2,q) by conjugation, through its action on the quotient space F_q^3/y. Then G_q = T twr P is primitive of twisted wreath type, and MinSubDeg(G_q) = k · MinSubDeg(H) = q(q^3 − 1)(q + 1)/c_q, where c_q is q + 1, 2(q − 1) or 2(q + 1) according as q is even, q ≡ 1 or q ≡ 3 (mod 4). By the reduction of the five authors this is a statement about the subgroups of PGL(3,q) of order greater than q^2(q − 1)c_q. We prove it for q ≥ 5 by a written argument from the list of the maximal subgroups of SL(3,q) (Mitchell; Hartley; tabulated by Bray, Holt and Roney-Dougal), Dickson's list of the subgroups of PGL(2,q) and an inverse-transpose duality; for q = 4 it is the result of the earlier note. Exhaustive computations for small q, with independently written programs, are tests and not part of the proof. No infinite family attaining the bound was found in the literature accessible to us; a search that finds nothing is not a proof of novelty. This is an unrefereed note. Unrefereed preprint released for independent mathematical scrutiny. Publication on Zenodo does not constitute peer review. AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text. Corpus identifier: OWR-793-006 (Praeger–Seress, On minimal subdegrees of finite primitive permutation groups, Oberwolfach Report 12/2005, Question 4; second note, after doi:10.5281/zenodo.23299864).

Zenodo (CERN European Organization for Nuclear Research)
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.