Block-avoiding point sequencings of arbitrary length in Steiner triple systems

Douglas R. Stinson; Shannon Veitch

arxiv: 1907.04416 · v1 · pith:PK4DDY4Anew · submitted 2019-07-09 · 🧮 math.CO · cs.DM

Block-avoiding point sequencings of arbitrary length in Steiner triple systems

Douglas R. Stinson , Shannon Veitch This is my paper

Pith reviewed 2026-05-25 00:10 UTC · model grok-4.3

classification 🧮 math.CO cs.DM

keywords Steiner triple systemspoint sequencingsblock-avoiding permutationsℓ-good sequencingscombinatorial designsexistence theorems

0 comments

The pith

Every Steiner triple system on enough points admits a sequencing of its points that avoids any block in ℓ consecutive positions, for any fixed ℓ at least 3.

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

The paper proves that Steiner triple systems admit ℓ-good sequencings whenever the number of points is large enough relative to a fixed ℓ. An ℓ-good sequencing is simply a linear ordering of the points in which no block of the design appears entirely inside any window of ℓ consecutive positions. This shows that the triple structure of an STS(v) imposes no unavoidable obstruction to such orderings once v exceeds some threshold depending only on ℓ. The result applies uniformly to every STS(v) of large order rather than to special constructions.

Core claim

For every integer ℓ ≥ 3 there exists an ℓ-good sequencing of any STS(v) provided v is sufficiently large. The authors also establish new nonexistence results for ℓ-good sequencings in certain smaller or specially structured STS(v).

What carries the argument

An ℓ-good sequencing, defined as a permutation of the point set in which no block is contained in any ℓ consecutive positions.

If this is right

Every sufficiently large STS(v) possesses at least one ℓ-good sequencing for each fixed ℓ ≥ 3.
The existence holds uniformly across all nonisomorphic STS(v) of large order rather than only for particular families.
Certain small-order or specially constructed STS(v) lack ℓ-good sequencings, as shown by the new nonexistence results.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The threshold on v may be made effective by replacing the asymptotic counting arguments with explicit constructions once the necessary inequalities are verified.
The same avoidance property may extend to other linear spaces or pairwise balanced designs whose block size is fixed.
Such sequencings could be used to produce orderings that control the appearance of triples in any window of fixed length.

Load-bearing premise

That the number of points v can be taken large enough depending only on the fixed length ℓ.

What would settle it

An explicit STS(v) with v exceeding the paper's threshold that admits no ℓ-good sequencing for some ℓ ≥ 3.

read the original abstract

An $\ell$-good sequencing of an STS$(v)$ is a permutation of the points of the design such that no $\ell$ consecutive points in this permutation contain a block of the design. We prove that, for every integer $\ell \geq 3$, there is an $\ell$-good sequencing of any STS$(v)$ provided that $v$ is sufficiently large. We also prove some new nonexistence results for $\ell$-good sequencings of STS$(v)$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives a uniform asymptotic existence theorem for ℓ-good sequencings in large STS(v) for any fixed ℓ ≥ 3, plus some new nonexistence results for small v.

read the letter

The paper establishes that for any fixed ℓ ≥ 3, sufficiently large Steiner triple systems admit an ℓ-good sequencing of their points. It also supplies some fresh nonexistence results for smaller orders. What stands out is the move from specific small ℓ to arbitrary fixed ℓ. Earlier papers handled ℓ=3 or 4 or so; this one gives a uniform statement. The nonexistence claims for small v are new and useful for completing the picture. The proof is combinatorial and relies on the 'sufficiently large' condition to make constructions or counting work. That is explicit in the theorem, so it holds up. No load-bearing gaps are apparent from the abstract and the stress test. A minor limitation is that the result is purely existential and asymptotic; it does not give an efficient way to find the sequencing or bound the size of v needed. For applications that need concrete small systems, this leaves work to do. But the paper does not claim more than that. This is for combinatorial design theorists. Someone studying orderings or avoidances in triple systems will find it relevant. It is not broad enough to interest a general audience in combinatorics. I would bring it to a reading group if the group focuses on designs. It deserves peer review; the central claim is grounded and the extension is worthwhile.

Referee Report

0 major / 2 minor

Summary. The paper defines an ℓ-good sequencing of an STS(v) as a permutation of its points such that no block is contained in any ℓ consecutive positions. It proves that for every fixed integer ℓ ≥ 3 there exists V(ℓ) such that every Steiner triple system of order v ≥ V(ℓ) admits an ℓ-good sequencing; the argument relies on asymptotic combinatorial constructions permitted by the “sufficiently large” hypothesis. The manuscript also establishes several new non-existence results for small v.

Significance. If the existence proof is correct, the result gives a uniform asymptotic answer to the block-avoiding sequencing problem for arbitrary fixed length ℓ, extending earlier work that treated only bounded ℓ or special families of STS. The explicit non-existence statements for small orders complement the main theorem and clarify the boundary of the asymptotic regime.

minor comments (2)

[Introduction / Theorem statement] The statement of the main theorem (presumably Theorem 1.1 or the result in §3) should explicitly record the dependence of V(ℓ) on ℓ, even if only as an existence claim, to make the quantifiers fully transparent.
[Non-existence results] In the non-existence section, the small-order examples would benefit from a short table listing the forbidden (v,ℓ) pairs together with the reason (e.g., parity, divisibility, or exhaustive search).

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, significance assessment, and recommendation to accept the manuscript. No major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity; standard asymptotic existence proof

full rationale

The paper establishes an existence result: for each fixed ℓ ≥ 3 there is a V(ℓ) such that every STS(v) with v ≥ V(ℓ) admits an ℓ-good sequencing. The argument relies on combinatorial constructions and counting arguments that become viable only for sufficiently large v, which is explicitly part of the theorem statement. No equations reduce a claimed prediction to a fitted parameter by construction, no self-citation chain is load-bearing for the central claim, and the derivation does not rename or smuggle in prior results via ansatz. The nonexistence results for small v are consistent with the asymptotic qualifier and introduce no internal inconsistency. The proof is self-contained against external combinatorial benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the standard definition of Steiner triple systems and the assumption that sufficiently large order permits combinatorial constructions; no free parameters or invented entities are visible from the abstract.

axioms (2)

standard math Steiner triple systems STS(v) exist precisely when v ≡ 1 or 3 mod 6
Standard background fact invoked implicitly by any statement about STS(v).
domain assumption Combinatorial constructions or counting arguments become available once v exceeds a threshold depending on ℓ
The existence proof is stated to hold only for sufficiently large v.

pith-pipeline@v0.9.0 · 5601 in / 1232 out tokens · 26091 ms · 2026-05-25T00:10:00.553697+00:00 · methodology

Block-avoiding point sequencings of arbitrary length in Steiner triple systems

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)