Pith. sign in

REVIEW 3 major objections 5 minor 27 references

Block-transitive t-(k^2,k,\lam) designs and simple exceptional groups of Lie type

T0 review · 3 major / 5 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 The paper proves that no block-transitive t-(k²,k,λ) design can have a finite simple exceptional group of Lie type as the socle of its automorphism group.

desk verdict A serious and probably correct classification result, but the decisive parabolic and subfield exclusions rest on an unpublished table and unshown Magma output, so the proof is not yet independently checkable. read the letter →

arxiv 2508.18660 v1 pith:5HKNVWK7 submitted 2025-08-26 math.GR math.CO

Xingyu Chen , Haiyan Guan This is my paper · ORCID
classification math.GRmath.CO MSC 05B0505B2520B25
keywords t-designblock-transitiveautomorphismgroupexceptionalofLietypepoint-primitivelargesubgroupst-(k^2kλ)design
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 proves a negative classification statement: if a nontrivial $t$-$({k}^{2},k,\lambda)$ design has an almost simple block-transitive automorphism group, then the socle of that group cannot be a finite simple exceptional group of Lie type. This matters because earlier work had reduced block-transitive automorphism groups of such `square' designs to affine or almost simple groups, so the theorem closes off the entire exceptional family at once and leaves only alternating, classical, and sporadic socles to consider. The proof exploits the point-primitivity that block-transitivity forces: the point stabilizer must be a `large' maximal subgroup, and the classification of those subgroups for exceptional Lie-type groups gives a short candidate list. Each candidate is then checked against the divisibility constraint $k+1 \mid (|G_x|, v-1)$ that follows from block-transitivity, and in every case the arithmetic forces $v=k^2$ to be impossible.

What carries the argument

The load-bearing mechanism is the pair of inequalities that convert block-transitivity into arithmetic restrictions. Corollary 2.5 gives $|G|<|G_x|^3$, so the point stabilizer is a `large' subgroup (meaning $|G|\le |H|^3$); Lemma 2.2 and Corollary 2.3 give $k+1 \mid n$ for every nontrivial subdegree $n$, hence $k+1 \mid (|G_x|,v-1)$. Tits' lemma (a proper subgroup whose index is prime to the defining characteristic lies in a parabolic subgroup) and a theorem on unique $p$-power subdegrees for parabolic actions turn the divisibility into explicit upper bounds on $k$. The classification of large maximal subgroups of almost simple groups with exceptional Lie-type socle is the central object: it supplies the finite candidate list for $G_x\cap X$ that the arithmetic checks eliminate one by one.

What would settle it

Recompute, for each finite simple exceptional group of Lie type and each maximal parabolic subgroup $P_i$, the ratio $v=|X:P_i|$ and the power of the defining prime dividing $|v-1|$; the theorem requires $k+1$ to divide the relevant gcd for the almost simple point stabilizer and the implied bound on $k$ to fall below $\sqrt{v}$, so a single parabolic pair satisfying all divisibility and square conditions would point directly to a candidate counterexample, and a wrong entry in the table used in Lemma 3.1 would invalidate that step.

Watch

Extended reading notes

Core claim

The paper's central claim is Theorem 1.1: for a nontrivial $t$-$({k}^{2},k,\lambda)$ design $\mathcal{D}$ with an almost simple block-transitive automorphism group $G$, the socle $X=\mathrm{Soc}(G)$ cannot be a finite simple exceptional group of Lie type. Assuming the contrary, the argument uses the known reduction that $G$ is point-primitive, so the point stabilizer $G_x$ is maximal in $G$ and does not contain $X$. From $v=k^2=|G:G_x|$ and $k+1 \mid (|G_x|,v-1)$ one obtains $|G|<|G_x|^3$, meaning $G_x$ is a large subgroup; the classification of large maximal subgroups of almost simple groups with exceptional socle then leaves only parabolic subgroups, subfield subgroups, and a short table of exceptional candidates. The proof removes the parabolic cases using subdegree divisibility and $p$-part bounds, removes subfield cases by gcd computations, handles small numerical cases directly, and then runs through the remaining maximal subgroups of ${}^2B_2(q)$, ${}^2G_2(q)$, ${}^3D_4(q)$, ${}^2F_4(q)$, $G_2(q)$, $F_4(q)$, $E_6(q)$, ${}^2E_6(q)$, $E_7(q)$, and $E_8(q)$, showing that in every case the forced divisibility makes $v=k^2$ impossible.

Load-bearing premise

The load-bearing premise is that an unpublished numerical table used in Lemma 3.1 correctly lists, for every remaining parabolic stabilizer, the exact power of the defining prime dividing $|v-1|$, and that each listed value makes $k+1$ divide $|v-1|$ with that power too small to permit $v=k^2$; if any entry is wrong or missing, a parabolic case is left open.

Editorial extensions

If this is right

  • Any almost simple block-transitive automorphism group of a $t$-$({k}^{2},k,\lambda)$ design must have alternating, classical, or sporadic socle; the exceptional Lie-type families are fully excluded.
  • For flag-transitive $2$-$({k}^{2},k,\lambda)$ designs with $\lambda \mid k$, the earlier no-exceptional-socle result is recovered as a special case of the block-transitive theorem.
  • Searches for such designs can skip stabilizers inside ${}^2B_2(q)$, ${}^2G_2(q)$, ${}^3D_4(q)$, ${}^2F_4(q)$, $G_2(q)$, $F_4(q)$, $E_6(q)$, ${}^2E_6(q)$, $E_7(q)$, and $E_8(q)$.
  • Future classification work on point-primitive almost simple groups for these designs is reduced to the classical, alternating, and sporadic families.

Reading between the lines

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

  • My inference: the same `large stabilizer plus $k+1$-divisibility' strategy should extend to classical socles, using the known large-subgroup classification; it may exclude or greatly shrink the classical candidate list.
  • My inference: the proof suggests a computational route to the same theorem, namely enumerating the classified large maximal subgroups, computing $v=|X:H|$ and the gcd constraints for admissible $q$, and checking that $v$ is never a square; this would make the unpublished parabolic table auditable.
  • My inference: because the divisibility inequality involves only $v=k^2$ and the point-stabilizer order, the method transfers to designs with $v=c k^2$ for a fixed small integer $c$ after replacing the square test by $v=c k^2$; the paper does not explore this.
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 / 5 minor

Summary. The paper proves Theorem 1.1: no block-transitive automorphism group of a nontrivial t-(k^2,k,λ) design can have socle a finite simple exceptional group of Lie type. The proof uses the known reduction that such a group is point-primitive and almost simple or affine, then combines the classification of large maximal subgroups of exceptional groups with subdegree and p-part divisibility arguments to eliminate, in turn, parabolic, subfield, and the remaining maximal-subgroup cases for 2B2(q), 2G2(q), 3D4(q), 2F4(q), G2(q), F4(q), E6±(q), E7(q), and E8(q).

Significance. The main theorem is a clean universal negative result: it closes the exceptional Lie-type family for block-transitive t-(k^2,k,λ) designs, complementing existing reductions and the sporadic and alternating cases. The high-level architecture is sensible: the reduction to point-primitivity, the use of Lemma 2.6 to bound the maximal stabilizers, and the subdegree arguments in Lemmas 3.4-3.12 are mostly explicit and checkable. That said, the proof leans on two kinds of large unshown computational input—unpublished Table 5 of [11] in Lemma 3.1 and Magma XGCD identities in Lemma 3.3—and contains at least one incorrect divisibility assertion in Lemma 3.2. Because the theorem is a universal negative over all exceptional groups, every maximal point stabilizer must actually be eliminated by a verifiable argument; as written, the decisive parabolic elimination is not independently checkable. I regard the central claim as very likely correct, but the manuscript needs substantial revision before it meets a standard acceptable for publication.

major comments (3)
  1. [Lemma 3.1, final paragraph] This paragraph eliminates all remaining parabolic cases by citing [11, Table 5] for the values of |v-1|_p and asserting that the resulting upper bounds are 'too small to satisfy v=k^2'. Neither the table nor the inequalities are reproduced, and the cited item is an arXiv preprint (1702.01257) rather than the published [2]. Since every parabolic maximal subgroup of every exceptional group except the few cases handled explicitly in Lemma 3.1 is disposed of only in this paragraph, a single erroneous entry in the table would leave an entire family of cases untreated. The manuscript must either reproduce the relevant rows of [11, Table 5] together with the derived upper bounds, or provide a self-contained derivation of the inequalities. In addition, the sentence 'Thus, k+1 ||v-1|_p' should be justified by showing that the unique p-power subdegree equals |v-1|_p in each row, not merely that k+1 divides that subdegree.
  2. [Lemma 3.2, G2(4) row] The proof says that for X = G2(4), Gx∩X = A1(13), v = 230400, k = 480, and 'this does not hold for k+1 | v−1'. This statement is factually wrong: 481 divides 230399, because 481·479 = 230399. The case is eliminated correctly by Corollary 2.3 only if one observes that k+1 does not divide gcd(|Gx|,v−1); indeed gcd(1092,230399) = 13, so 481 ∤ gcd(1092,230399). As written, the justification for this row is false. This discrepancy shows that the numerical eliminations in Table 3 need independent checking; the authors should verify every row using the correct gcd condition and state the relevant gcd values.
  3. [Lemma 3.3] The proof of the subfield cases depends on Magma XGCD computations that are not shown: e.g., the assertion that for (2B2(q), 2B2(q0)) there exist polynomials P and Q with P|Gx∩X| + Q(v−1) = 20, and the claim that 'using similar computations' yields the list in Table 4. Without the explicit polynomials, the inequality v < (|Gx|,v−1)^2, or the exhaustive search leading to the candidate q values, a reader cannot verify that all subfield subgroups have been eliminated. The table also lists 'possible q' entries such as '2 2' and 'i2 with i ≤ 5' that are cryptic; the manuscript should state the actual q values and, for each, the value of v that fails to be a square.
minor comments (5)
  1. [Lemma 3.1, 2B2(q) and 2G2(q) arguments] In the 2B2(q) paragraph, 'k = 2m−1' should read 'k+1 = 2^m' (and similarly 'k = 3m−1' in the 2G2(q) paragraph should read 'k+1 = 3^m'); the displayed equations then become (2^m−1)^2 = 2^{2(2e+1)}+1 and (3^m−1)^2 = 3^{3(2e+1)}+1, which are the intended contradictions.
  2. [Table 3, G2(2) row] The row 'G2(2) 12096 484375' is ambiguous: G2(2) is not simple, and the numerical data appear to belong to X = G2(5) with H∩X = G2(2). The table should label the row as (X, Gx∩X) = (G2(5), G2(2)) with the appropriate |Gx∩X| and v.
  3. [Lemma 3.1, E6(q), P1 case] The displayed inequality '(q^{12}-1)(q^9-1) < q^2(q^4+1)^2(q^4-1)(q-1)' seems dimensionally inconsistent and is not explained; it should be derived from k+1 | q(q^4+1) and v = k^2. Please show the intermediate algebra.
  4. [Data availability] The data availability statement reads 'No date was used for the research described in this article.' This should be corrected to 'No data was used...'.
  5. [References] Reference [11] appears to be an earlier arXiv version of the published [2]; the authors should clarify its relationship to [2] and, if the required table appears in [2], cite the published source instead, or explain why the preprint version is necessary.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular dependency: the proof relies on external classification theorems, design-theoretic reductions, and cited numerical tables, none of which assume or encode Theorem 1.1.

full rationale

The dependency chain is self-contained relative to its cited inputs. The structural reduction to point-primitive almost simple groups is quoted from [10, Corollary 2.1] and Guan-Zhou's published work, which is a general result on block-transitive t-(k^2,k,lambda) designs and does not assume that the socle is non-exceptional. Lemma 2.2, also from [10], gives the necessary condition k+1 dividing a nontrivial subdegree; this is derived from the design equations with v=k^2 and is used repeatedly as an external lemma, not as a restatement of the target theorem. The classification of large maximal subgroups in Lemma 2.6 is cited from [2, Theorem 1.2], and the subdegree information in Lemma 2.8 from [2, Theorem 4.1]; these are independent published classification results. The parabolic elimination in Lemma 3.1 depends on [11, Table 5] for the p-parts |v-1|_p, which is an unpublished external numerical table. That dependency is a reproducibility or correctness risk, not a circular one: the table is not a fitted parameter of this paper, nor is it the theorem being proved. No step in the argument renames Theorem 1.1 as an assumption, fits a parameter to the target data and calls it a prediction, or imports a uniqueness theorem from the present authors' prior work to force the conclusion. The only self-citation, [10], is a broadly applicable reduction theorem with independent published content, not a load-bearing appeal to an unverified prior result. There is a factual slip in Lemma 3.2: for G2(4) with Gx∩X = A1(13), k+1 = 481 does divide v-1 = 230399, so the printed reason in that row is wrong; the intended contradiction likely uses k+1 dividing gcd(|Gx|, v-1). But this is an incorrect assertion inside an elimination, not a circular derivation of the main theorem. Similarly, the unreproduced [11, Table 5] is a numerical premise needing audit, not an input-output equivalence. Overall, no specific circular step can be exhibited, and the honest finding is score 0.

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

The paper contributes no new axioms, entities, or parameters. It imports deep classification theorems (large maximal subgroups, subdegrees, Tits' lemma) and makes two unverified computational assertions (the unpublished [11, Table 5] and the Magma Bezout identities). The reader's burden is verifying these imported and computational facts.

assumptions (6)
  • domain assumption Reduction theorem from [10]: a block-transitive automorphism group of a nontrivial t-(k^2,k,λ) design is point-primitive and either affine or almost simple.
    Used at the start of Section 3 to conclude that Gx is maximal in G and does not contain X; this is the framework of the entire proof.
  • domain assumption Lemma 2.6 = [2, Theorem 1.2]: every large maximal subgroup H of an almost simple group with exceptional socle X and H not containing X is parabolic or in Table 1.
    Together with Corollary 2.5 (|G| < |Gx|^3), this restricts the point stabilizer to a finite list; completeness of this list is load-bearing.
  • domain assumption Lemma 2.8 = [2, Theorem 4.1]: the listed subdegrees divide the given |H:K| values for the actions in Table 2.
    Invoked throughout Lemmas 3.6-3.12 to obtain integer divisibility constraints on k+1.
  • standard math Tits' lemma (Lemma 2.10) and Lemma 2.12 ([19]) on subdegrees of parabolic actions being a unique p-power for all but Ld(q), PΩ+2m(q), E6(q).
    Used in Corollary 2.11 and in the parabolic elimination of Lemma 3.1.
  • domain assumption The values of |v-1|_p listed in [11, Table 5] for the remaining parabolic cases are correct.
    The final paragraph of Lemma 3.1 cites this table to rule out all parabolic cases not treated explicitly; [11] is an unpublished submitted preprint and the table is not reproduced.
  • ad hoc to paper The Magma XGCD computations in Lemma 3.3 produce the claimed Bezout identities and the exhaustive list of q values in Table 4.
    The polynomials P,Q and computation logs are not provided; the subfield case elimination depends on this computational claim.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Block-transitive t-(k^2,k,\lam) designs and simple exceptional groups of Lie type." pith.science (2026). https://pith.science/paper/5HKNVWK7

@misc{pith2026250818660,
  author       = {Pith},
  title        = {Pith review of: Block-transitive t-(k^2,k,\lam) designs and simple exceptional groups of Lie type},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5HKNVWK7}},
  note         = {Machine review of arXiv:2508.18660}
}
read the original abstract

Let G be an automorphism group of a nontrivial t-(k^2,k,\lambda) design. In this paper, we prove that if G is block-transitive, then the socle of G cannot be a finite simple exceptional group of Lie type.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

27 extracted references · 26 canonical work pages

  1. [2]

    S. H. Alavi, M. Bayat and A. Daneshkhah, Finite exceptional groups of Lie type and symmetric designs. Discrete Math. 345, 112894 (2022)

    work page 2022

  2. [11]

    S. H. Alavi, M. Bayat, and A. Daneshkhah, Finite exceptional groups of Lie type and symmetric designs. Submitted arXiv: 1702.01257

    arXiv

  3. [1]

    S. H. Alavi, M. Bayat and A. Daneshkhah, Symmetric designs admitting flag-transitive and point-primitive automorphism groups associated to two dimensional projective spe- cial groups. Des. Codes Cryptogr. 79, 337-351 (2016)

    work page 2016

  4. [3]

    S. H. Alavi and T. C. Burness, Large subgroups of simple groups. J. Algebra 421, 187–233 (2015)

    work page 2015

  5. [4]

    Bosma, J

    W. Bosma, J. J. Cannon and C. Playoust, The Magma algebra system I: The user language. J. Symbolic Comput. 24, 235–265 (1997)

    work page 1997

  6. [5]

    J. N. Bray, D. F. Holt and C. M. Roney-Dougal, The maximal subgroups of the low- dimensional finite classical groups. London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge, 407 (2013)

    work page 2013

  7. [6]

    J. H. Conway et al., Atlas of finite groups. Oxford University Press, New York (1985)

    work page 1985

  8. [7]

    B. N. Cooperstein, Maximal subgroups of G2(2n). J. Algebra 70, 23–36 (1981)

    work page 1981

Show all 27 references
  1. [8]

    D. A. Craven, The maximal subgroups of the exceptional groupsF4(q),E6(q) and 2E6(q) and related almost simple groups. Invent. Math. 234, 637–719 (2023)

    2023

  2. [9]

    Gorenstein, R

    D. Gorenstein, R. N. Lyons and R. M. Solomon, The classification of the finite simple groups, Number 3, Mathematical Surveys and Monographs, vol. 40. American Mathe- matical Society, Providence, RI (1998)

    1998

  3. [10]

    H. Y. Guan and S. L. Zhou, Reduction for block-transitive t-(k2,k,λ ) designs. Des. Codes Cryptogr. 92, 3877–3894 (2024)

    2024

  4. [12]

    P. B. Kleidman, The maximal subgroups of the Chevalley groups G2(q) withq odd, the Ree groups 2G2(q), and their automorphism groups. J. Algebra 117, 30–71 (1988) 18

    1988

  5. [13]

    P. B. Kleidman, The maximal subgroups of the Steinberg triality groups 3D4(q) and of their automorphism groups. J. Algebra 115, 182–199 (1988)

    1988

  6. [14]

    P. B. Kleidman and M. W. Liebeck, The subgroup structure of the finite classical groups. London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge, 129 (1990)

    1990

  7. [15]

    T. Lan, W. J. Liu and F. Yin, Block-transitive 3-( v,k, 1) designs on exceptional groups of Lie type. J. Algebraic Combin. 59, 879–897 (2024)

    2024

  8. [16]

    Lawther, Folding actions

    R. Lawther, Folding actions. Bull. London Math. Soc. 25, 132–144 (1993)

    1993

  9. [17]

    M. W. Liebeck, C. E. Praeger and J. Saxl, On the 2-closures of finite permutation groups. J. London Math. Soc. (2) 37, 241–252 (1988)

    1988

  10. [18]

    M. W. Liebeck, C. E. Praeger and J. Saxl, The maximal factorizations of the finite simple groups and their automorphism groups. Mem. Amer. Math. Soc. 86 (1990)

    1990

  11. [19]

    M. W. Liebeck, J. Saxl and G. M. Seitz, On the overgroups of irreducible subgroups of the finite classical groups. Proc. London Math. Soc. (3) 55, 507–537 (1987)

    1987

  12. [20]

    M. W. Liebeck, J. Saxl and G. M. Seitz, Subgroups of maximal rank in finite exceptional groups of Lie type. Proc. London Math. Soc. (3) 65, 297–325 (1992)

    1992

  13. [21]

    Malle, The maximal subgroups of 2F4(q2)

    G. Malle, The maximal subgroups of 2F4(q2). J. Algebra 139, 52–69 (1991)

    1991

  14. [22]

    Montinaro, A classification of flag-transitive 2-(k2,k,λ ) designs withλ|k

    A. Montinaro, A classification of flag-transitive 2-(k2,k,λ ) designs withλ|k. J. Combin. Theory Ser. A 197, 105750 (2023)

    2023

  15. [23]

    Montinaro, Classification of the non-trivial 2-( k2,k,λ ) designs, with λ|k, admitting a flag-transitive almost simple automorphism group

    A. Montinaro, Classification of the non-trivial 2-( k2,k,λ ) designs, with λ|k, admitting a flag-transitive almost simple automorphism group. J. Combin. Theory Ser. A 195, 105710 (2023)

    2023

  16. [24]

    Montinaro and E

    A. Montinaro and E. Francot, On flag-transitive 2-( k2,k,λ ) designs with λ | k. J. Combin. Des. 30, 653–670 (2022)

    2022

  17. [25]

    Saxl, On finite linear spaces with almost simple flag-transitive automorphism groups

    J. Saxl, On finite linear spaces with almost simple flag-transitive automorphism groups. J. Combin. Theory Ser. A 100, 322–348 (2002)

    2002

  18. [26]

    G. M. Seitz, Flag-transitive subgroups of Chevalley groups. Ann. of Math. (2) 97, 27–56 (1973)

    1973

  19. [27]

    Suzuki, On a class of doubly transitive groups

    M. Suzuki, On a class of doubly transitive groups. II, Ann. of Math. (2) 79, 514–589 (1964) 19

    1964

Pith tools

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