{
  "schema_version": 1,
  "problem_number": "OWR-793-006",
  "title": "An Infinite Family of Primitive Groups of Twisted Wreath Type Attaining the Upper Bound for the Minimal Subdegree",
  "author": {
    "name": "Alper Ferudun",
    "affiliation": "Mercury Software GmbH",
    "url": "https://github.com/AlperTheKing"
  },
  "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.",
  "result_type": "COMPLETE_NEGATIVE_ANSWER",
  "categories": [
    "math.GR",
    "math.CO"
  ],
  "keywords": [
    "primitive permutation groups",
    "twisted wreath products",
    "O'Nan–Scott type TW",
    "minimal subdegree",
    "suborbits",
    "subdegrees",
    "PGL(3,q)",
    "PSL(2,q)",
    "maximal subgroups of SL(3,q)",
    "Dickson's theorem",
    "infinite family",
    "negative answer",
    "Oberwolfach Reports problems",
    "UnsolvedMath",
    "OWR-793-006",
    "math.GR",
    "math.CO",
    "open mathematics"
  ],
  "manuscript_version_date": "2026-10-14",
  "publication_date": "2026-10-14",
  "publication_date_kind": "first public online release",
  "version": "1.0",
  "date_modified": "2026-10-14",
  "presentation_revision_only": false,
  "doi_archived_file_version": "1.0",
  "status": "unrefereed preprint",
  "canonical_url": "https://eulersolve.org/papers/owr-793-006-b/",
  "pdf_url": "https://eulersolve.org/papers/owr-793-006-b/paper.pdf?v=afc3ece66207",
  "doi": "10.5281/zenodo.23366613",
  "zenodo_record_url": "https://zenodo.org/records/23366613",
  "license": "https://creativecommons.org/licenses/by/4.0/",
  "scope_caveat": "Second note on the question of Praeger and Seress (Oberwolfach Report 12/2005, Question 4; Question 1.6 of Giudici, Li, Praeger, Seress and Trofimov): for every prime power q >= 4 the twisted wreath group PSL(2,q) twr PGL(3,q) attains the upper bound MinSubDeg(G) = k MinSubDeg(H). The proof for q >= 5 uses the list of maximal subgroups of SL(3,q) as transcribed in the literature (the book of Bray, Holt and Roney-Dougal was not read); q = 4 is the first note. Novelty is not certified.",
  "files": {
    "paper.pdf": {
      "sha256": "afc3ece662070e955bc78582bf6acfb6c5e0599a746e49a838fa634ee8d46153"
    },
    "source.zip": {
      "sha256": "74271a4212f454356011fec819516711fdf19c5d170f691b7e395d1f9f0444bc"
    },
    "verification_report.md": {
      "sha256": "d06d7cea2fc9a262846c8143f21163e334adf3acbcd4e9ecaa311a8f9811a2f6"
    }
  },
  "ai_use_disclosure": "AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text."
}