Pith. sign in

REVIEW 3 major objections 5 minor 1 cited by

Point-transitive Steiner systems S(2,6,111/121/126), S(2,7,169/175)

T0 review · 3 major / 5 minor · reviewed 2026-08-16 · deepseek-v4-flash

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

Pith's one-line read The paper claims a complete census of 30 point-transitive S(2,6,111) Steiner systems, and new difference families for four further parameter sets.

desk verdict Honest raw data with checkable constructions, but the headline enumeration claim leans on unpublished code; worth refereeing if the code ships. read the letter →

arxiv 2504.14931 v1 pith:ESFLC5AW submitted 2025-04-21 math.CO

Ivan Hetman This is my paper · ORCID
classification math.CO MSC 05B0505B1005E18
keywords Steinersystemsdifferencefamiliespoint-transitivedesignsS(26111)combinatorialdesignenumerationautomorphismgroupsblockisomorphismfingerprints
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

A Steiner system $S(2,k,v)$ is a collection of $k$-element blocks on $v$ points such that every pair of points lies in exactly one block. This paper claims to introduce new Steiner systems $S(2,6,111)$, $S(2,6,121)$, $S(2,6,126)$, $S(2,7,169)$, and $S(2,7,175)$ by writing them as difference families in finite groups, mostly commutative except for the $S(2,6,111)$ case. Most entries are asserted to be new, and the lists are presented as exhaustive enumerations for the searched groups. The headline claim is that for $v=111$ there are exactly 30 non-isomorphic point-transitive Steiner systems with automorphism group $\mathbb{Z}_{37}\rtimes\mathbb{Z}_3$, one previously known and 29 apparently unknown. A reader should care because complete point-transitive systems with block size 6 or 7 are sparse, and these results replace isolated examples with a census.

What carries the argument

The load-bearing object is a difference family: a collection of $k$-element blocks inside a finite group such that every non-identity group element occurs the same number of times as a difference of two entries in a block, so that translating by the group makes the resulting Steiner system point-transitive. The search is carried out by a generalization of an earlier cyclic difference-family algorithm to commutative groups, plus a first attempt for the non-commutative case. To certify non-isomorphism, the paper computes a hyperbolic-frequency fingerprint, counting, for non-collinear triples $oxy$ and points $p$ on $xy$, the points $u$ on $oy$ for which the line $pu$ does not meet $ox$; equal fingerprints are followed up with a private reimplementation of graph isomorphism. The multiplier of a difference family supplies a lower bound on the automorphism group of the design.

What would settle it

Independently enumerate all difference families in $\mathbb{Z}_{37}\rtimes\mathbb{Z}_3$ for block size 6 using an independent exhaustive method, or run an independent graph-isomorphism check on the thirty printed systems; finding more than 30 non-isomorphic systems, or finding two of the claimed new systems to be isomorphic, would refute the central claim. A cheaper partial check is to verify that every 111-point block list satisfies the Steiner property and that each of the 29 non-first designs is non-isomorphic to the first.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that the listed difference families and block lists are valid constructions of Steiner systems with the stated parameters, that they are pairwise non-isomorphic, and that the lists are exhaustive for the groups searched. For $S(2,6,111)$, the paper argues that $\mathbb{Z}_{37}\times\mathbb{Z}_3$ cannot produce a design and that the semidirect product $\mathbb{Z}_{37}\rtimes\mathbb{Z}_3$ is the only remaining point-transitive group; exhaustive search then yields 30 non-isomorphic systems whose full automorphism groups have order exactly 111. The first of these 30 is the known design, and the paper states that the others appear to be unknown. For the remaining parameters, the examples are given as multiplier, hyperbolic-frequency fingerprint, and difference family, with a few marked as already known (for instance a $S(2,7,175)$ design with multiplier 24, which forces $4200$ to divide the automorphism-group order). The paper is explicit that the generalized search algorithm proving exhaustiveness will be published later, so the constructions themselves are the content of this paper.

Load-bearing premise

The paper's load-bearing premise is that the not-yet-published generalized search algorithm really is exhaustive and that the private reimplementation of graph isomorphism classifies designs correctly; if either fails, the claimed count of 30 for $S(2,6,111)$ and the novelty of the remaining designs collapse, even if the printed blocks themselves are valid.

Editorial extensions

If this is right

  • Every listed difference family yields an explicit Steiner system with the stated parameters whose translation group acts point-transitively, giving constructions that others can copy and test directly.
  • If the enumeration for $S(2,6,111)$ is sound, the previously isolated example is completed by a full census of 30 non-isomorphic systems, settling the point-transitive case for that parameter set and group.
  • The hyperbolic-frequency fingerprints give a practical isomorphism filter for Steiner systems with $k\ge 5$, and the printed lists provide concrete test cases for stronger isomorphism invariants.
  • Multiplier data yield automorphism-group lower bounds such as $24\cdot 175=4200$ for the flagged $S(2,7,175)$ design, linking the constructions to questions about which groups arise as full automorphism groups.
  • The extension from cyclic to general finite groups means the pipeline can be rerun on other admissible parameters, so additional point-transitive Steiner systems are likely to appear once the full algorithm is published.

Reading between the lines

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

  • A natural testable extension is to rerun the same enumeration on the next admissible parameter sets with $k=6$ or $k=7$; the paper's method suggests that many more point-transitive systems will appear than currently catalogued.
  • The hyperbolic-frequency invariant deserves independent analysis: if its distinguishing power can be characterized theoretically, it may serve as a structural certificate rather than merely a practical filter.
  • If the count of 30 for $S(2,6,111)$ is independently verified, that family becomes a rare complete classification of point-transitive Steiner systems with a small non-abelian automorphism group, and a useful source of examples for questions about group realizability.
  • Because the paper marks certain entries as possibly known, a careful reconciliation with published catalogues could change which of the 30 designs are considered new, though the count of isomorphism classes itself would not change.
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 presents explicit difference families and block lists for point-transitive Steiner systems S(2,k,v) with (k,v) = (6,111), (6,121), (6,126), (7,169), and (7,175), together with several smaller examples for k = 3,4,5. The central claim is that for v = 111 there are exactly 30 non-isomorphic S(2,6,111) systems with automorphism group of order 111 isomorphic to Z37⋊Z3, one due to Mills and the remaining ones asserted to be new. The constructions are given as raw data, and the paper also introduces a 'hyperbolic frequency' fingerprint used to distinguish designs. The enumeration is attributed to a generalized difference-family algorithm whose description is deferred to a later paper.

Significance. If the enumeration and isomorphism claims are correct, the paper provides new explicit point-transitive Steiner systems for five parameter sets and determines the exact number of S(2,6,111) systems with a point-transitive automorphism group of order 111. The printed block lists are explicit and machine-checkable, and the frequency fingerprint is a legitimate isomorphism invariant rather than a fitted parameter; these are real strengths. However, the exact-count and novelty claims currently rest on unpublished software and a private reimplementation of nauty, so the significance of the paper depends on an independent reproducibility check.

major comments (3)
  1. [Section 4, second paragraph] The central claim of exactly 30 non-isomorphic systems is not independently verifiable from the manuscript. The text says the count was 'confirmed by generalized algorithm which will be published later', and Section 2 describes the isomorphism tool only as 'a naive copy of nauty' in Java, with no code or formal specification. Since the hyperbolic frequency fingerprint is not a complete invariant—Example 3.1 exhibits two same-fingerprint designs that are non-isomorphic—the pairwise non-isomorphism and completeness of the 30-item list depend entirely on this private software. Please provide a reproducible certificate, a complete algorithm description, or an independent verification (for example machine-checked canonical forms) for the S(2,6,111) list.
  2. [Section 3, opening paragraph] The blanket sentence 'All this results are enumerations, so they give exhaustive list of difference families that generate non-isomorphic Steiner systems' is contradicted by the manuscript's own Example 3.2, which says that isomorphism was not checked and that some listed designs could be isomorphic. The statement should be restricted to the cases where the fingerprint is proved to be a complete invariant or where a nauty-level isomorphism test is actually run; otherwise the published lists in Sections 3.1–3.4 cannot be read as exhaustive non-isomorphic classifications.
  3. [Section 4, first paragraph] The assertion 'It is obvious that group Z37 × Z3 can't produce any' is load-bearing for the exhaustiveness of the search, because it is the step that eliminates the abelian group of order 111 and leaves only Z37 ⋊ Z3. Since the paper's headline count claims to be exhaustive, please include a proof or a precise computational argument for this elimination, for example a counting or orbit argument showing that no difference family with the required parameters exists in that group.
minor comments (5)
  1. [Section 2] The claims connecting fingerprint keys to projective spaces, affine spaces, and unitals are stated without proof or precise definitions; since they are not needed for the main results, please either remove them or provide a reference and a precise statement.
  2. [Example 3.2] The term 'multiplier-nonisomorphic' is not defined; please define it or rephrase to avoid confusion with non-isomorphic designs, especially because the same passage states that isomorphism was not checked.
  3. [References and citations] Citations to [1], [7], and the 'future paper' describing the algorithm are informal; please add precise references or explicitly state that the algorithm is not yet available.
  4. [Section 4] The raw block lists are very long and no validation command, checksum, or verification script is provided; adding a short machine-readable verification script would substantially improve reproducibility.
  5. [Throughout] There are numerous typographical and grammatical errors, such as 'All this results are enumerations', 'others seems to be unknown', 'freequency', and 'alrogithm'; a careful copyedit is needed.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the explicit difference families are independently checkable; the enumeration claims depend on the author's unpublished algorithm, which is a verification gap rather than a circular derivation.

full rationale

The paper's central contribution is a list of explicitly printed difference families and block designs for Steiner systems S(2,6,111), S(2,6,121), S(2,6,126), S(2,7,169), and S(2,7,175). Each printed family can be independently checked to generate an S(2,k,v), so the existence claims are not derived by fitting parameters or by circular definitions. The enumeration and novelty claims, such as "there are 30 non-isomorphic Steiner systems" for S(2,6,111) and the assertion that designs are "unknown", rest on the author's own unpublished generalized algorithm and a private Java reimplementation of nauty. Section 4 says these results were "confirmed by generalized algorithm which will be published later", and Section 2 describes the isomorphism filter as a "naive copy of nauty" with no code shipped. This is a reproducibility and verification gap, not a circular derivation: the explicit constructions do not reduce by construction to the claimed conclusions. The hyperbolic frequency fingerprint is used only as an isomorphism filter, and the paper explicitly acknowledges it is not a complete invariant by stating same-frequency designs are "almost sure" isomorphic and "then is checked by nauty reimplementation"; Example 3.1 even exhibits two same-fingerprint non-isomorphic designs. No equation in the paper defines its output in terms of the target result, and no fitted parameter is renamed as a prediction. Self-citations to the author's prior and future work are motivational or point to forthcoming algorithms, and the printed block lists do not depend on those citations for their internal correctness. Score 1 reflects the minor self-reliance on the author's own software and future algorithm without load-bearing circularity.

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

No numeric parameters are fitted in this paper. The load-bearing assumptions are domain conventions about difference families, completeness of an unpublished search, and correctness of the author's private software.

assumptions (4)
  • standard math A difference family with parameters (v,k,1) generated by a group action yields a Steiner system S(2,k,v).
    Used throughout Section 3; referenced to VI.16 of [2], not proved in the paper.
  • domain assumption The hyperbolic frequency is an isomorphism invariant, and distinct fingerprints certify non-isomorphism.
    Defined heuristically in Section 2; no formal proof is given that it is invariant or that it separates all relevant designs.
  • ad hoc to paper The generalized CDF algorithm exhaustively enumerates all difference families for the listed groups.
    Section 3 says "All this results are enumerations, so they give exhaustive list"; the algorithm is deferred to a future paper in Section 1.
  • domain assumption The Handbook and Krcadinac database contain all previously known Steiner systems for the listed parameters, so unmarked designs are new.
    Section 1: "I assume that ... Krcadinac website contain most recent data regarding Steiner systems."

how reviews work

0 comments
Cite this review

Pith. "Pith review of Point-transitive Steiner systems S(2,6,111/121/126), S(2,7,169/175)." pith.science (2026). https://pith.science/paper/ESFLC5AW

@misc{pith2026250414931,
  author       = {Pith},
  title        = {Pith review of: Point-transitive Steiner systems S(2,6,111/121/126), S(2,7,169/175)},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ESFLC5AW}},
  note         = {Machine review of arXiv:2504.14931}
}
abstract

In this paper new Steiner systems $S(2,6,111)$, $S(2,6,121)$, $S(2,6,126)$, $S(2,7,169)$, $S(2,7,175)$ and possibly others with point-transitive (commutative except $S(2,6,111)$ case) automorphism groups are introduced.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Point-transitive and 1-rotational unitals of order 5

    math.CO 2025-04 conditional novelty 7.0 of 10

    The paper enumerates all non-isomorphic unitals of order 5 with a point-transitive group of order 126 or a 1-rotational group of order 125, yielding 1214 and 97 designs respectively.

Reference graph

Works this paper leans on

11 extracted references · 6 canonical work pages · cited by 1 Pith paper

  1. [1]

    Hetman Steiner systems S(2,6,121/126), S(2,7,169) based on differ ence families , 2024-2025

    I. Hetman Steiner systems S(2,6,121/126), S(2,7,169) based on differ ence families , 2024-2025. https://doi.org/10.48550/arXiv.2401.08274

    arXiv doi:10.48550/arxiv.2401.08274 2024

  2. [2]

    C. J. Coulborn, J. H. Dinitz Handbook of Combinatorial Designs, Second Edition , 2007

    2007

  3. [3]

    Krcadinac personal website https://web.math.pmf.u nizg.hr/ krcko/results/steiner.html

    V. Krcadinac personal website https://web.math.pmf.u nizg.hr/ krcko/results/steiner.html

  4. [4]

    D´ avid Mez˝ ofi, G´ abor P. Nagy. New Steiner systems from o ld ones by paramodifications, 2020. https://doi.org/10.48550/arXiv.2003.09233

    work page Pith review arXiv doi:10.48550/arxiv.2003.09233 2020

  5. [5]

    D´ avid Mez˝ ofi, G´ abor Nagy list of paramodified unitals https://davidmezofi.github.io/unitals/

  6. [6]

    McKay, Adolfo Piperno

    Brendan D. McKay, Adolfo Piperno. Practical graph isomo rphism, II, 2013. https://doi.org/10.48550/arXiv.1301.1493

    arXiv doi:10.48550/arxiv.1301.1493 2013

  7. [7]

    Mathoverflow question https://mathoverflow.net/quest ions/457534/is-every-uniform-hyperbolic-linear-space-infinite

    work page

  8. [8]

    Construction of (v, k , 1) cyclic difference families with small parameters, preprint

    Hetman I., Baicheva T., Topalova S. Construction of (v, k , 1) cyclic difference families with small parameters, preprint

    work page

Show all 11 references
  1. [9]

    Classification results for (v, k, 1) cyclic difference famili es with small parameters

    Baicheva T., Topalova S. Classification results for (v, k, 1) cyclic difference famili es with small parameters . In: Deza M., Petitjean M., Markov K. (eds.) Mathematics of Dista nces and Applications, pp. 24—30. International Book Series: Information Science and Computing, Book...

  2. [10]

    Github repository, 2023

    2023

  3. [11]

    W. H. Mills, The construction of balanced incomplete bl ock designs with λ =1, Congress. Numer. 20 (1978), 131-148

    1978

Pith tools

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