{
  "schema_version": 1,
  "problem_number": "KOU-17.91",
  "title": "A Gap of Three Between the Derived Lengths of a Finite Soluble Group and of a Maximal Subgroup (Kourovka Notebook Problem 17.91)",
  "author": {
    "name": "Alper Ferudun",
    "affiliation": "Mercury Software GmbH",
    "url": "https://github.com/AlperTheKing"
  },
  "abstract": "Problem 17.91 of the Kourovka Notebook, posed by V. S. Monakhov and also Question 9 of a survey of Monakhov and Trofimuk (2010), asks whether d(G) − d(M) ≤ k for an absolute constant k, for all finite soluble groups G and maximal subgroups M, where d is the derived length, and asks for the least such k. We answer neither part. We show that k ≥ 3 if k exists: the split extension G = 3^{1+2}_+ ⋊ GL(2,3) of order 1296 has derived length 6, and its maximal subgroup 3^{1+2}_+ ⋊ B of index 4, with B a Borel subgroup, has derived length 3. By an exhaustive computer search in the SmallGroups library, reduced by elementary lemmas, 1296 is the least order of a finite soluble group with a maximal subgroup M such that d(G) − d(M) ≥ 3, and exactly three groups of order 1296 have one. We prove that d(G) − d(M) ≤ 1 + min{e, d(M_G)}, where M_G is the core of M and e = d(M/M_G), and deduce that a difference 4 needs |G| ≥ 5184; we also give a formula for split extensions which explains why the construction does not iterate in the simplest cases. In a second pair with difference 3, of order 41472, the group is a primitive permutation group of degree 64. The group G itself is a term of an extraspecial tower of Glasby and Howlett. Related results of Doerk, of Gol'chuk and Monakhov, and of Murashka and Vasil'ev concern other lengths or special cases and do not answer the question. The contribution is modest. This is an unrefereed note.",
  "result_type": "PARTIAL_RESULT",
  "categories": [
    "math.GR"
  ],
  "keywords": [
    "Kourovka Notebook",
    "Monakhov",
    "derived length",
    "maximal subgroups",
    "finite soluble groups",
    "primitive soluble groups",
    "extraspecial groups",
    "SmallGroups library",
    "computer-assisted proof",
    "partial answer",
    "UnsolvedMath",
    "KOU-17.91",
    "math.GR",
    "open mathematics"
  ],
  "manuscript_version_date": "2026-10-27",
  "publication_date": "2026-10-27",
  "publication_date_kind": "first public online release",
  "version": "1.0",
  "date_modified": "2026-10-27",
  "presentation_revision_only": false,
  "doi_archived_file_version": "1.0",
  "status": "unrefereed preprint",
  "canonical_url": "https://eulersolve.org/papers/kou-17-91/",
  "pdf_url": "https://eulersolve.org/papers/kou-17-91/paper.pdf?v=e74d9392fdb9",
  "doi": "10.5281/zenodo.23695696",
  "zenodo_record_url": "https://zenodo.org/records/23695696",
  "license": "https://creativecommons.org/licenses/by/4.0/",
  "scope_caveat": "Neither part is answered: whether d(G) − d(M) is bounded, and the least bound, stay open; the least-order statement is computer-assisted (GAP, SmallGroups); the contribution is modest; unrefereed.",
  "files": {
    "paper.pdf": {
      "sha256": "e74d9392fdb970ea8c754a91db573314d6cc8380484b20f4603a93a05de58dd5"
    },
    "source.zip": {
      "sha256": "3b394cc84642e64418324e2faa0d79a7948fe63d450797361e953c49318ae092"
    },
    "verification_report.md": {
      "sha256": "fa8674092f7dc281c0311407eca8d7867785941362f79ff7f512f6b1cb402376"
    }
  },
  "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."
}