Pith. sign in

REVIEW 2 major objections 4 minor 13 references

Block-transitive t-(k^2,k,\lambda) designs associated to two dimensional projective special linear groups

T0 review · 2 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 The paper proves that every non-trivial block-transitive t-(k^2,k,λ) design whose automorphism group contains PSL(2,q) must have q=8 and be a 2-(36,6,λ) design.

desk verdict A useful classification for a subfield, but Theorem 1.1 is false as stated: the complete 2-(9,3,7) design is non-trivial under the paper's own definition and violates the conclusion. read the letter →

arxiv 2508.19515 v1 pith:5RE7SEDY submitted 2025-08-27 math.GR

Guoqiang Xiong , Haiyan Guan This is my paper · ORCID
classification math.GR MSC 05B0505B2520B25
keywords t-designsblock-transitiveautomorphismgroupsprojectivespeciallinearPSL(2q)point-primitivereductions2-(366λ)designsmaximalsubgroupscosetspacedesignconstruction
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

This paper aims to classify non-trivial block-transitive t-($k^{2}$,k,λ) designs whose automorphism group G contains the projective special linear group PSL(2,q) with G inside Aut(PSL(2,q)), for q≥4. The main theorem asserts that in every such design the group parameter must be q=8, the point stabilizer is the dihedral group D14, and the design is a 2-(36,6,λ) design. If the theorem is correct, the infinite family collapses to a finite, explicit list: 46 designs for G=PSL(2,8) with λ∈{2,6,12}, and 330 designs for G=PΓL(2,8) with λ∈{2,6,9,12,18,36}. The interest is that this gives a complete structural description of one whole infinite family of block-transitive t-designs, with every possibility written down in tables.

What carries the argument

The load-bearing mechanism is the point-primitive reduction: an imported theorem ensures that a block-transitive automorphism group of a t-($k^{2}$,k,λ) design acts primitively on points, so each point stabilizer is a maximal subgroup. The point set is identified with the coset space G/G_α, giving v=|G:G_α|, and the design parameter equations together with a subdegree divisibility lemma force k+1 to divide certain subdegrees. The case analysis then runs through the complete list of maximal subgroups of an almost simple group with socle PSL(2,q), using index computations and divisibility to eliminate every q except 8; for q=8, a computer search over all 6-subsets of a 36-point set up to the group action produces the full design lists.

What would settle it

A disproof would be a single block-transitive t-($k^{2}$,k,λ) design with automorphism group G satisfying PSL(2,q) ≤ G ≤ Aut(PSL(2,q)) for some q≠8, or with q=8 and λ outside the listed sets. A reader could run an exhaustive orbit search on the coset action of PSL(2,16) or PSL(2,32), taking all k-subsets whose size squared equals the index, and check whether any yields a design; if one exists, Theorem 1.1 is false.

Watch

Extended reading notes

Core claim

The paper's central claim is that the purely numerical constraints `k+1 | n` on subdegrees and `k+1` divisibility involving the outer automorphism group, combined with the maximal-subgroup classification for groups with socle PSL(2,q), leave only one admissible case. Concretely, Theorem 1.1 states that a non-trivial t-($k^{2}$,k,λ) design with a block-transitive group G satisfying X=PSL(2,q) ≤ G ≤ Aut(X), q≥4, must have q=8, X_α ≅ D14, and the design must be a 2-(36,6,λ) design. The proof rules out every other maximal subgroup of PSL(2,q), including the projective line stabilizer, the dihedral subgroups, the subfield subgroups, and the exceptional A4, S4, and A5 cases. For the surviving case q=8, the authors carry out a computational orbit search and list all designs up to isomorphism: the λ values are {2,6,12} for G=PSL(2,8) and {2,6,9,12,18,36} for G=PΓL(2,8), with four flag-transitive examples matching an earlier construction.

Load-bearing premise

The load-bearing premise is the imported theorem that a block-transitive automorphism group of a t-($k^{2}$,k,λ) design is point-primitive, because the exhaustive maximal-subgroup case split in Section 3 covers all possibilities only if that theorem holds; the argument also relies on the convention that 'non-trivial' means t<k<v, which is what discards the complete 2-(9,3,7) design in the q=8, k=3 case.

Editorial extensions

If this is right

  • Every non-trivial block-transitive t-(k^2,k,λ) design with PSL(2,q) ≤ G ≤ Aut(PSL(2,q)) and q≥4 has v=36, k=6, and t=2, so higher-strength designs do not arise in this family.
  • For G=PSL(2,8), the only possible λ values are 2, 6, and 12, realized by exactly 46 designs up to isomorphism.
  • For G=PΓL(2,8), λ can only be 2, 6, 9, 12, 18, or 36, realized by exactly 330 designs up to isomorphism.
  • No non-trivial design of this type exists for any q≠8, so the full automorphism groups PSL(2,q) contribute only the single parameter value q=8.
  • The four flag-transitive 2-(36,6,λ) designs admitted by PGL(2,8) reappear in the new lists, confirming the earlier construction and embedding it in the complete classification.

Reading between the lines

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

  • If the same point-primitive reduction holds for other simple socles, the identical divisibility machinery could be applied to families such as classical groups of Lie type; the main missing ingredient would be the analogous maximal-subgroup lists.
  • The explicit tables suggest a testable extension: an independent orbit-counting verification of the 46 and 330 designs could confirm that the computer search was exhaustive, since the paper does not display the search code.
  • The forced value q=8 may hint at a general phenomenon that block-transitive t-(k^2,k,λ) designs with simple socle concentrate at very small prime powers; testing the next admissible groups directly would show whether the divisibility constraints alone already force this concentration.
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

2 major / 4 minor

Summary. The paper classifies block-transitive t-(k^2,k,lambda) designs whose automorphism group G contains X=PSL(2,q), q>=4, with X normal in G and G<=Aut(X). Theorem 1.1 claims that any such nontrivial design must have q=8, point stabilizer X_alpha isomorphic to D14, and parameters 2-(36,6,lambda); Theorem 1.2 then lists the possible lambda values and explicit base blocks obtained by GAP for PSL(2,8) and PGammaL(2,8). The proof proceeds by a maximal-subgroup case split based on the point-primitivity reduction imported from [10], with arithmetic eliminations in Sections 3.1-3.3 and computational construction in Section 4.

Significance. If the intended classification is repaired to exclude complete designs, this would be a useful contribution: it completes the PSL(2,q) case of the block-transitive t-(k^2,k,lambda) program, gives explicit base blocks and lambda lists, and agrees with the previously known flag-transitive 2-(36,6,lambda) examples. The arithmetic eliminations are mostly coherent, there are no fitted parameters, and the GAP tables are a valuable resource. However, the main theorem as stated is false because of a complete design that satisfies the paper's own definition of nontrivial, so the positive assessment is conditional on a substantial correction to the statement.

major comments (2)
  1. [Section 3.3, Case (1); Section 1] The treatment of the q=8, k=3, v=9 case is not a contradiction under the paper's own definition. In Section 1, a design is called non-trivial when t<k<v. Let P be the 9 points of PG(1,8) and let B consist of all 3-subsets of P. This is the complete 2-(9,3,7) design, and t=2<k=3<v=9, so it is non-trivial by the paper's definition. Since PSL(2,8) (and every group between it and PGammaL(2,8)) is 3-transitive on the 9 points, the group is transitive on all 3-subsets, so the design is block-transitive; it also satisfies X=PSL(2,8) <= G <= Aut(X) with q=8>=4. Thus all hypotheses of Theorem 1.1 hold. The conclusion fails: the point stabilizer has order 504/9=56, namely 2^3*7, not D14, and the design is not a 2-(36,6,lambda) design. The sentence 'Therefore D is trivial, a contradiction' silently uses a second, undefined notion of triviality meaning 'complete design'. Theorem 1.1 is therefore false as stated; either the definition must explicitly exclude complete designs or Theorem 1.1 must include this exceptional complete 2-(9,3,7) design.
  2. [Section 3.2, Case (3); Lemma 2.6] In Lemma 2.6(3), the subgroup D_{q+1} is listed for all odd prime powers q=p^f with q not equal to 7 or 9. However, the Case (3) paragraph begins 'Since q is an odd prime' and then uses the subdegree data from [7, Table 2]. If that table applies to all odd prime powers, the word 'prime' should be replaced by 'prime power' and the source should be quoted for that range; if the table applies only to prime q, then q=25,27,49,... are not eliminated and the exhaustive case split is incomplete. Please state the exact validity range of the subdegree data and adjust the hypothesis of this case accordingly.
minor comments (4)
  1. [Section 3, first paragraph] The point-primitive reduction is imported from [10, Theorem 1], and the entire maximal-subgroup split rests on it; please state the precise hypotheses of that theorem and confirm that its notion of nontrivial design matches the definition used in this paper.
  2. [Section 4] The GAP computation is described by commands and tables, but no GAP code, log files, or verification scripts are included, and the data availability statement says only that data are available on reasonable request; for verifiability, please attach the code and output as ancillary files.
  3. [Appendix, Table 3] In Table 3, row number 74 is duplicated and row 75 is skipped; please renumber the rows.
  4. [Throughout] There are several typos and notational issues: the title lacks a space ('Block-transitivet'), 'Magam' in Lemmas 4.1 and 4.3 should be 'Magma', and the notation D14:2 in Lemma 4.3 should be defined or accompanied by its order.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the proof is an arithmetic and subgroup case split, and the cited prior reduction is real external support rather than a circular input.

full rationale

The claimed derivation is a case-by-case enumeration over maximal subgroups of PSL(2,q). No parameter is fitted to data and then renamed as a prediction; no displayed equation is equivalent to the theorem's conclusion by construction. The most heavily used external input is [10, Theorem 1] and Lemmas 2.2-2.3, which come from a prior paper by one of the present authors. That reliance is load-bearing for point-primitivity and for the divisibility conditions, but it is a previously published theorem with its own proof and with assumptions that do not already contain the target classification for PSL(2,q); it supplies the reduction framework, not the conclusion q=8, D14, 2-(36,6,lambda). The remaining inputs (Dickson's subgroup classification, Giudici's maximal-subgroup table, Faradzev-Ivanov subdegrees, and the GAP enumeration) are external computational and structural facts. One genuine defect appears in Section 3.3 Case (1), where the complete 2-(9,3,7) design is excluded by the sentence 'Thus B includes all 3-subsets of P. Therefore, D is trivial, a contradiction', even though that design satisfies the paper's own definition of non-trivial as t<k<v. This is a correctness/definitional inconsistency that makes Theorem 1.1 false as stated, but it is not a circular reduction: the exclusion is asserted, not obtained by assuming the theorem's conclusion, and no fitted input or self-referential equation is involved. Accordingly, the circularity score is 0.

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

No free parameters are fitted and no new entities are introduced. The central claim rests on imported classification and subdegree results, chiefly [10, Theorem 1], the Giudici-Dickson maximal subgroup lists, and the Faradzev-Ivanov subdegree tables. The GAP enumeration invokes standard library functions but ships no code or certificates.

assumptions (4)
  • domain assumption Guan-Zhou reduction [10, Theorem 1]: a block-transitive automorphism group of a t-(k^2,k,lambda) design is point-primitive, and its socle is either affine or almost simple.
    Imported from a paper by one of the present authors. If this reduction fails, the exhaustive maximal-subgroup analysis in Section 3 does not cover all block-transitive groups. It enters at the start of Section 3.
  • domain assumption Dickson and Giudici classification of maximal subgroups of almost simple groups with socle PSL(2,q), as stated in Lemmas 2.5, 2.6, and 2.7.
    Provides the exhaustive case split used throughout Section 3. If a maximal subgroup class were missing, a possible design could be overlooked.
  • domain assumption Faradzev-Ivanov subdegree tables for PSL(2,q) permutation actions, cited as [7, Table 2].
    Used to identify non-trivial subdegrees in the odd and even characteristic cases. Incorrect subdegree lists would invalidate several divisibility contradictions.
  • standard math Block's theorem: a block-transitive automorphism group is also point-transitive.
    Basis for working with point stabilizers and point-primitive actions; cited as [2] in Section 1.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Block-transitive t-(k^2,k,\lambda) designs associated to two dimensional projective special linear groups." pith.science (2026). https://pith.science/paper/5RE7SEDY

@misc{pith2026250819515,
  author       = {Pith},
  title        = {Pith review of: Block-transitive t-(k^2,k,\lambda) designs associated to two dimensional projective special linear groups},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5RE7SEDY}},
  note         = {Machine review of arXiv:2508.19515}
}
read the original abstract

This paper investigates block-transitive automorphism groups of t-(k^2,k,\lambda) designs. Let D be a non-trivial t-(k^2,k,\lambda) design, G \leq \Aut(D) be block-transitive with X\unlhd G\leq \Aut(X), where X = PSL(2,q)(q\geq4). Then q = 8 and D is a 2-(36,6,\lambda) design with \lambda \in \{2,6,9,12,18,36\}.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

13 extracted references · 11 canonical work pages

  1. [10]

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

    work page 2024

  2. [1]

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

    work page 2016

  3. [2]

    R. E. Block, On the orbits of collineation groups, Math. Z. 96 (1967), 33-49

    work page 1967

  4. [3]

    Bosma, J

    W. Bosma, J. Cannon, C. Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput. 24(3-4) (1997), 235-265, Computational algebra and number theory (London, 1993). http://dx.doi.org/10.1006/jsco.1996.0125 12

    arXiv 1997

  5. [4]

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

    work page 2013

  6. [5]

    J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, R. A. Wilson, ATLAS of finite groups, Oxford Univ. Press, Eynsham (1985)

    work page 1985

  7. [6]

    L. E. Dickson, Linear groups: With an exposition of the Galois field theory, Dover, New York, (1958)

    work page 1958

  8. [7]

    I. A. Faradzev, A. A. Ivanov, Distance-transitive representations of groups G with PSL2(q)⊴G⊴ PΓL2(q), European J. Combin. 11(4) (1990), 347-356

    work page 1990

Show all 13 references
  1. [8]

    https://www.gap-system.org

    The GAP Group, GAP-Groups, Algorithms, and Programming, Version 4.14.0, (2024). https://www.gap-system.org

    2024

  2. [9]

    Giudici, Maximal subgroups of almost simple groups with socle PSL(2 ,q ), (2007)

    M. Giudici, Maximal subgroups of almost simple groups with socle PSL(2 ,q ), (2007). https://doi.org/10.48550/arXiv.math/0703685

    2007 doi arXiv

  3. [11]

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

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

    2023

  4. [12]

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

    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 (2023), 105710

    2023

  5. [13]

    Montinaro, E

    A. Montinaro, E. Francot, On flag-transitive 2-( k2,k,λ ) designs with λ|k, J. Combin. Des. 30(10) (2022), 653-670. 13 Appendix Table 3 Block-transitive 2-(62, 6,λ ) designs with P ΓL(2, 8) Case Base block B λ Case Base block B λ 1 {1, 2, 3, 4, 5, 18} 36 2 {1, 2, 3, 4, 5, 20} ...

    2022

Pith tools

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