Pith. sign in

REVIEW 3 major objections 4 minor 37 references

The Saxl hypergraph of a permutation group

T0 review · 3 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper classifies the finite permutation groups whose Saxl hypergraph is complete: exactly the Frobenius groups, the natural alternating and symmetric groups, certain projective-line groups, the Suzuki groups in their doubly…

desk verdict Solid new invariant and classification, but the main theorem leans on an unshown finite computation that a referee should push on. read the letter →

arxiv 2505.13849 v1 pith:2IXJSJ3G submitted 2025-05-20 math.GR math.CO

Melissa Lee , Anthony Pisani This is my paper · ORCID
classification math.GRmath.CO MSC 20B1520B0505C6505C25
keywords SaxlhypergraphbasesizepermutationgroupscompleteclassificationCommonNeighbourConjectureflag-spanningtoursprimitive2-transitive
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper introduces the Saxl hypergraph of a permutation group: the hypergraph whose vertices are the points being permuted and whose edges are exactly the bases of minimal size. Its central result is a classification of the groups for which this hypergraph is complete, meaning every set of $b(G)$ points already forms a base, and the list is short: Frobenius groups, alternating and symmetric groups in their natural actions, certain projective-line groups, Suzuki groups in their doubly transitive action, and four sporadic exceptional actions. The paper also proves that, conditional on the generalised Common Neighbour Conjecture, every primitive group with base size at most seven has the property that any two points lie in two minimal bases meeting in exactly one point, and it gives a partial classification of base-size-three and base-size-four primitive groups whose Saxl hypergraph admits a flag-spanning tour. These results matter because they delimit, in concrete group-theoretic terms, how far the strongest possible base structure can extend beyond the classical base-size-two case.

What carries the argument

The Saxl hypergraph $\mathcal{H}(G)$ is the hypergraph on $\Omega$ whose edges are the bases of $G$ of size $b(G)$. The recursion driving the completeness classification is Lemma 3.1: $G$ is $K(n)$, meaning every $n$ points form a base, if and only if each point stabiliser $G_\alpha$ acting on $\Omega\setminus\{\alpha\}$ is $K(n-1)$; this yields Corollary 3.2 that every $K(n)$ group is $(n-1)$-transitive, which funnels the problem into the known list of finite 2-transitive groups. For the flag-spanning tour theorem, the operative mechanism is the criterion that a hypergraph has a flag-spanning tour exactly when it has an even number of vertices and even valency, reducing the proof to parity calculations for the valency of $\mathcal{H}(G)$.

What would settle it

A direct computation in the four sporadic actions of Theorem 1.3(v) would settle the asserted computational confirmation: list all bases of minimal size and verify that every $b(G)$-element subset has trivial pointwise stabiliser. For the common-neighbour part, test Conjecture 4.3 on the affine groups with base size at most seven; a pair of vertices whose minimal-base edges always meet in at least two points would be a counterexample, and under Theorem 4.5 would disprove the generalised Common Neighbour Conjecture for that group.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.3: a group $G \le \mathrm{Sym}(\Omega)$ with $b(G) \ge 2$ has a complete Saxl hypergraph if and only if $G$ is Frobenius; an alternating or symmetric group in its natural action; a projective-line group among $\mathrm{PSL}_2(q)$, $\mathrm{PGL}_2(q)$, or $\mathrm{PSL}_2(q^2).C_2 \not\le \mathrm{P}\Sigma\mathrm{L}_2(q^2)$; a Suzuki group $^2B_2(q)$ in its doubly transitive action; or one of $(\mathrm{PSL}_2(11),12)$, $(\mathrm{PGL}_2(11),12)$, $(M_{11},11)$, $(M_{12},12)$. The proof rests on Lemma 3.1, which characterises the property recursively: a group has every $n$ points forming a base exactly when each point stabiliser does the same for $n-1$, so any such group with base size at least three must act $(n-1)$-transitively and the classification reduces to running through the finite 2-transitive groups. Beyond the classification, Theorem 1.5 shows that for primitive groups with base size at least three the common-neighbour number $g_2$ is never exactly one, and Theorem 1.6 gives a partial classification of primitive groups of base size three or four whose Saxl hypergraph admits a flag-spanning tour.

Load-bearing premise

The classification of Theorem 1.3 depends on the standard classification of finite 2-transitive groups and on unshown computer checks for the sporadic actions, while the common-neighbour results in Theorem 4.5 further assume the unproved generalised Common Neighbour Conjecture.

Editorial extensions

If this is right

  • Completeness of the Saxl hypergraph is a very rigid property: a group outside the five listed families must contain a $b(G)$-element subset whose pointwise stabiliser is nontrivial, so the classification gives a ready-made certificate for non-completeness.
  • The recursion of Lemma 3.1 transfers the problem to point stabilisers, so any future classification of $K(n-1)$ groups automatically extends to $K(n)$ groups by taking stabilisers.
  • For primitive groups of base size at least three, the common-neighbour conjecture, if true, implies not just one but at least two common neighbours for every vertex pair, strengthening the conjectured diameter bound.
  • Under the generalised Common Neighbour Conjecture, Conjecture 4.3 holds for all primitive groups with base size at most seven, all affine groups, almost simple groups in non-standard actions, many diagonal- and product-type groups, and all groups of degree at most 128.
  • For primitive groups with base size 3 or 4, a flag-spanning tour exists except in the explicit families listed in Theorem 1.6, including odd-degree groups, certain soluble affine groups, product-type exceptions, $\mathrm{PSL}_2(q)$ and $\mathrm{PGL}_2(q)$ with $q \equiv 3 \bmod 4$, and $\mathrm{P}\Gamma\mathrm{L}_2(2^e)$ for square-free odd $e$.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural test of Theorem 1.3 is to compute, for the four sporadic actions, all bases of minimal size and verify directly that every $b(G)$-set has trivial stabiliser; these computations are asserted but not exhibited, and an independent verification would make the classification self-contained.
  • The $g_3 = 0$ affine examples in Theorem 4.12 suggest that the Common Neighbour Conjecture cannot be strengthened to triples of vertices, so the hypergraph viewpoint exposes the exact threshold: pairs are special, and any stronger common-neighbour hypothesis would need a different condition.
  • Because completeness of $\mathcal{H}(G)$ implies sharp $(n-1)$-transitivity, the classification could be re-derived by enumerating sharply multiply transitive groups and checking the $K(n)$ stabiliser recursion, giving a computational route to verify the theorem without relying on the unstated sporadic computations.
  • If the generalised Common Neighbour Conjecture is ever proved, Theorem 4.5 would immediately resolve Conjecture 4.3 in all the listed classes; conversely, any counterexample to Conjecture 4.3 within those classes would disprove the generalised conjecture, tying the two conjectures together as a single testable target.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. This paper introduces the Saxl hypergraph H(G) of a permutation group G, whose edges are the bases of minimum size b(G), and studies three themes. Theorem 1.3 classifies the groups whose Saxl hypergraph is complete, extending the Saxl-graph classification for b(G)=2. Section 4 analyses common-neighbour properties: Conjecture 4.3 (a hypergraph strengthening of the Common Neighbour Conjecture) is proved for several large classes of primitive groups assuming the generalised CNC (Theorem 4.5), and gossip numbers are studied (Theorems 4.10 and 4.12). Section 5 treats valency and flag-spanning tours, giving a partial classification for primitive groups with b(G) in {3,4} (Theorems 1.6, 5.2, and 5.4). The paper is clearly organised and makes appropriate use of standard classifications of 2-transitive and primitive groups.

Significance. If correct, Theorem 1.3 provides a complete and elegant classification of permutation groups with complete Saxl hypergraphs, a natural counterpart to the known Saxl-graph results. The conditional results in Section 4 give substantial evidence for a plausible hypergraph analogue of the CNC, and the flag-spanning tour results open a new research direction. The paper is careful in stating which results depend on the unproved generalised CNC. However, several finite computational assertions that are load-bearing for the classifications are made without supplying scripts, certificates, or reproducible details; these should be provided or replaced by proofs.

major comments (3)
  1. [§3, proof of Theorem 1.3 (affine q=2 case)] The exclusion of the five exceptional affine groups (d,G0) = (4,S6), (4,A6:C2), (4,A7), (6,PΣU3(3)≅G2(2)), and (6,PSU3(3)) rests entirely on the assertion 'Computations confirm none of these correspond to K(3) groups' with no code, certificate, or reproducible detail supplied. This check is load-bearing for the 'only if' direction of Theorem 1.3. Since K(3) is equivalent to the condition that every pair of distinct nonzero vectors in V_d(2) has trivial pointwise stabiliser in G0, this is a routine finite verification; please provide a script (e.g., in GAP or Magma) or a short mathematical argument.
  2. [§5, Lemma 5.4 and proof of Theorem 1.6] The assertion 'Computations show PSL3(3).2 gives rise to valency 9750' is a finite check that determines whether this group is included in Table 4, but no computation is supplied. Similar unshown computational checks appear elsewhere, for instance in the proof of Theorem 4.5 where it is stated that one can 'confirm computationally that there are 7 regular orbits on Ω^7' for M24. These computations affect the stated classifications and should be made reproducible or replaced by explicit arguments.
  3. [§4, Lemma 4.8] The proof of Lemma 4.8 contains a full duplicated paragraph, appearing almost verbatim twice ('It only remains to consider the possibility that span(B′) ≠ span(B) ... An application of Lemma 4.7 completes the proof.'), and the two copies are inconsistent in the displayed inequality (the first reads |Ev| + 1 and the second |Ev−w| + 1). This is a cut-and-paste error that obscures the argument; please remove the duplicate and reconcile the notation so that the intended proof is unambiguous.
minor comments (4)
  1. [Theorem 1.3(iii)] The notation 'PSL2(q2).C2̸≤ PΣL2(q2)' is garbled and does not name a group; it should be written as, for example, 'G = PSL2(q^2).C2 with the C2 not contained in PΣL2(q^2)', or the intended group should be described in words as in the proof.
  2. [§5 heading] The section heading 'V alency' contains a stray space and should be 'Valency'.
  3. [§2.3, Remark 2.4] The phrase 'as occurs for any edge when G is a symmetric group' would be clearer as 'as occurs, for example, when G is a symmetric group in its natural action and the edge is a base containing a pair of points interchanged by a transposition in G'.
  4. [§3, proof of Lemma 3.1] The sentence 'At most one orbit of such G can have the property that it contains fixed points of more than half the elements of G' would benefit from a short justification or a reference, since it is used to deduce transitivity of K(2) groups.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the derivation is a genuine classification argument based on external standards (Dixon–Mortimer, O'Nan–Scott) and explicit case checks, not a reduction of conclusions to inputs.

full rationale

The paper's central classification (Theorem 1.3) is not circular: it defines K(n) as b(G)=n with every n-subset a base, proves in Lemma 3.1 and Corollary 3.2 that K(n) implies (n-1)-transitivity, and then enumerates candidates using the external Dixon--Mortimer classification of 2-transitive groups. The subsequent elimination of affine, projective, symplectic, unitary, Suzuki, and Ree cases is group-theoretic and geometric, not a restatement of the conclusion. The line 'Computations confirm none of these correspond to K(3) groups' is an unverified computational claim and therefore a correctness/evidence gap, but it is not circular: the check tests the same definition against the classification list; it is neither a fitted parameter nor an imported uniqueness theorem. The conditional results in Section 4 explicitly assume Conjecture 4.1 and then derive stronger conclusions under stated structural hypotheses; this is a clearly declared hypothesis, not a hidden use of the target theorem. The self-citation to Freedman et al. [20], which includes Lee as an author, is minor and not load-bearing: it is used only to justify connectedness in Lemma 2.2(iii) and does not feed into Theorem 1.3 or the main conditional theorems. The duplicated paragraph in Lemma 4.8 is an editing artifact, not a circular derivation. I therefore find no significant circularity.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper introduces no fitted numerical parameters; group-theoretic parameters such as q and k are inputs from the group under discussion. The main load-bearing assumptions are the standard classifications of finite groups, the accuracy of cited tables of maximal subgroups, and the unproved generalised Common Neighbour Conjecture. The computational checks are asserted without artefacts, which is an assumption the reader must accept on trust.

assumptions (5)
  • standard math Classification of finite multiply transitive and 2-transitive groups (Dixon and Mortimer, Section 7.7).
    Used throughout the proof of Theorem 1.3 to narrow the list of candidate groups with complete Saxl hypergraphs.
  • standard math O'Nan-Scott theorem for finite primitive groups.
    Used in Sections 4 and 5 to organize primitive groups into affine, almost simple, diagonal, product, and twisted wreath type.
  • domain assumption Burness's tables of soluble maximal subgroups [7, Tables 9.4-7] and Burness-Huang [11, Table 7.4] are accurate.
    These tables feed the exceptional cases Tables 1 and 4 in the proof of Theorem 1.6; the paper does not re-derive them.
  • domain assumption The generalised Common Neighbour Conjecture (Conjecture 4.1) holds.
    Theorems 1.5 and 4.5 are explicitly conditional on this unproved conjecture, which is inherited from earlier work on Saxl graphs.
  • domain assumption Unshown GAP computations in Sections 3, 4.1, and 4.2 are correct.
    The manuscript asserts several finite checks, including 'Computations confirm none of these correspond to K(3) groups' and the computational treatment of Table 3, without providing code or certificates.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Saxl hypergraph of a permutation group." pith.science (2026). https://pith.science/paper/2IXJSJ3G

@misc{pith2026250513849,
  author       = {Pith},
  title        = {Pith review of: The Saxl hypergraph of a permutation group},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2IXJSJ3G}},
  note         = {Machine review of arXiv:2505.13849}
}
abstract

Given a permutation group $G \le \mathrm{Sym}(\Omega)$, a subset $B$ of $\Omega$ is said to be a base if its pointwise stabiliser in $G$ is trivial, and the base size $b(G)$ is the minimum size of a base. In the notable case $b(G) = 2$, Burness and Giudici define the Saxl graph of $G$ to be the graph on $\Omega$ with bases of size 2 as edges. Later work of Freedman et al. extends this notion to any group for which $b(G) \ge 2$, taking the pairs of points contained in bases of size $b(G)$ for edges. We study an alternative generalisation, the Saxl hypergraph, where bases of size $b(G)$ are themselves the edges. In particular, we consider groups with complete Saxl hypergraphs, primitive groups whose Saxl hypergraphs have flag-spanning tours, and appropriate generalisations of Burness and Giudici's Common Neighbour Conjecture.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

37 extracted references · 36 canonical work pages

  1. [1]

    Spanning Euler Tours in Hypergraphs

    A. Bahmanian and S. Shan. Spanning euler tours in hypergraphs, 2024. arXiv:2403.12713. 30 MELISSA LEE AND ANTHONY PISANI

    work page Pith review arXiv 2024

  2. [2]

    R. F. Bailey and P. J. Cameron. Base size, metric dimension and other invariants of groups and graphs. Bulletin of the London Mathematical Society , 43(2):209–242, 2011

    work page 2011

  3. [3]

    J. N. Bray, D. F. Holt, and C. M. Roney-Dougal. The Maximal Subgroups of the Low-Dimensional Finite Classical Groups . Cambridge University Press, 2013

    work page 2013

  4. [4]

    A. Bretto. Hypergraph Theory: An Introduction . Mathematical Engineering. Springer International Publishing, 2013

    work page 2013

  5. [5]

    T. C. Burness. On base sizes for actions of finite classical groups. Journal of the London Mathematical Society. Second Series , 75(3):545–562, 2007

    work page 2007

  6. [6]

    Local representation theory and simple groups

    T. C. Burness. Simple groups, fixed point ratios and applications. In Local repre- sentation theory and simple groups. Extended versions of short lecture courses given during a semester programme on “Local representation theory and simple groups” held at the Centre Interfacultaire Bernoulli of the EPF Lausanne, Switzerland, 2016 , pages 267–322. Z¨ urich:...

    work page 2016

  7. [7]

    T. C. Burness. Base sizes for primitive groups with soluble stabilisers. Algebra & Number Theory, 15(7):1755–1807, 2021

    work page 2021

  8. [8]

    T. C. Burness and M. Giudici. On the saxl graph of a permutation group. Mathemat- ical Proceedings of the Cambridge Philosophical Society , 168(2):219–248, 2018

    work page 2018

Show all 37 references
  1. [9]

    T. C. Burness, R. M. Guralnick, and J. Saxl. On base sizes for symmetric groups. Bulletin of the London Mathematical Society , 43(2):386–391, 2011

    2011

  2. [10]

    T. C. Burness and H. Y. Huang. On the Saxl graphs of primitive groups with soluble stabilisers. Algebraic Combinatorics, 5(5):1053–1087, 2022

    2022

  3. [11]

    T. C. Burness and H. Y. Huang. On base sizes for primitive groups of product type. Journal of Pure and Applied Algebra , 227(3):107228, 2023

    2023

  4. [12]

    T. C. Burness, M. W. Liebeck, and A. Shalev. Base sizes for simple groups and a conjecture of cameron. Proceedings of the London Mathematical Society , 98(1):116– 162, 2008

    2008

  5. [13]

    T. C. Burness, E. A. O’Brien, and R. A. Wilson. Base sizes for sporadic simple groups. Israel Journal of Mathematics , 177:307–333, 2010

    2010

  6. [14]

    C´ aceres, D

    J. C´ aceres, D. Garijo, A. Gonz´ alez, A. M´ arquez, and M. L. Puertas. The determining number of Kneser graphs. Discrete Mathematics and Theoretical Computer Science. DMTCS, 15(1):1–14, 2013

    2013

  7. [15]

    P. J. Cameron and W. M. Kantor. Random permutations: Some group-theoretic aspects. Combinatorics, Probability and Computing , 2(3):257–262, 1993

    1993

  8. [16]

    Chen and S

    H. Chen and S. Du. On the Burness–Giudici conjecture. Communications in Algebra, 51(12):5019–5045, 2023

    2023

  9. [17]

    Chen and H

    J. Chen and H. Y. Huang. On valency problems of Saxl graphs. Journal of Group Theory, 25(3):543–577, 2022

    2022

  10. [18]

    del Valle and C

    C. del Valle and C. M. Roney-Dougal. The base size of the symmetric group acting on subsets. Algebraic Combinatorics, 7(4):959–967, 2024

    2024

  11. [19]

    J. D. Dixon and B. Mortimer. Permutation Groups. Springer New York, 1996

    1996

  12. [20]

    S. D. Freedman, H. Y. Huang, M. Lee, and K. Rekv´ enyi. On the generalised saxl graphs of permutation groups, 2024. arXiv:2410.22613

    2024

  13. [21]

    N. Gill, B. Lod` a, and P. Spiga. On the height and relational complexity of a finite permutation group. Nagoya Mathematical Journal , 246:372–411, 2022

    2022

  14. [22]

    Z. Halasi. On the base size for the symmetric group acting on subsets. Studia Scien- tiarum Mathematicarum Hungarica , 49(4):492–500, 2012

    2012

  15. [23]

    Halasi, M

    Z. Halasi, M. W. Liebeck, and A. Mar´ oti. Base sizes of primitive groups: Bounds with explicit constants. Journal of Algebra , 521:16–43, 2019

    2019

  16. [24]

    H. Y. Huang. Base sizes of primitive groups of diagonal type. Forum of Mathematics, Sigma, 12, 2023. THE SAXL HYPERGRAPH OF A PERMUTATION GROUP 31

    2023

  17. [25]

    Hulpke, O

    A. Hulpke, O. Konovalov, C. M. Roney-Dougal, and C. Russell. PrimGrp, gap prim- itive permutation groups library, Version 3.4.3. https://gap-packages.github.io/ primgrp/, 2022. GAP package

    2022

  18. [26]

    W. M. Kantor. Homogeneous designs and geometric lattices. J. Combin. Theory Ser. A, 38(1):66–74, 1985

    1985

  19. [27]

    P. B. Kleidman and M. W. Liebeck. The Subgroup Structure of the Finite Classical Groups. Cambridge University Press, 1990

    1990

  20. [28]

    Lee and T

    M. Lee and T. Popiel. Saxl graphs of primitive affine groups with sporadic point stabilizers. International Journal of Algebra and Computation , 33(2):369–389, 2023

    2023

  21. [29]

    M. W. Liebeck and J. Saxl. The primitive permutation groups of odd degree. Journal of the London Mathematical Society , s2-31(2):250–264, 1985

    1985

  22. [30]

    M. W. Liebeck and A. Shalev. Bases of primitive permutation groups. InGroups, com- binatorics and geometry. Proceedings of the L. M. S. Durham symposium, Durham, UK, July 16–26, 2001 , pages 147–154. River Edge, NJ: World Scientific, 2003

    2001

  23. [31]

    S. P. Mansilla and O. Serra. On s-arc transitive hypergraphs. European Journal of Combinatorics, 29(4):1003–1011, 2008

    2008

  24. [32]

    Moscatiello and C

    M. Moscatiello and C. M. Roney-Dougal. Base sizes of primitive permutation groups. Monatshefte f¨ ur Mathematik, 198(2):411–443, 2022

    2022

  25. [33]

    X. Ouvrard. Hypergraphs: an introduction and review, 2020. arXiv:2002.05014

    2020 arXiv

  26. [34]

    L. Pyber. Asymptotic results for simple groups and some applications. In Groups and computation II. Workshop on groups and computation, June 7–10, 1995, New Brunswick, NJ, USA , pages 309–327. Providence, RI: American Mathematical Soci- ety, 1997

    1995

  27. [35]

    A. Seress. The minimal base size of primitive solvable permutation groups. Journal of the London Mathematical Society. Second Series , 53(2):243–255, 1996

    1996

  28. [36]

    A. Seress. Primitive groups with no regular orbits on the set of subsets. Bulletin of the London Mathematical Society , 29(6):1, 1997

    1997

  29. [37]

    A. Seress. Permutation Group Algorithms . Cambridge University Press, 2003. School of Mathematics, Monash University, Clayton VIC 3800, Australia Email address :{melissa.lee, anthony.pisani}@monash.edu

    2003

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.