Sequencing Partial Steiner Triple Systems

Adri\'an Pastine; Brian Alspach; Donald L. Kreher

arxiv: 1907.10760 · v1 · pith:JR56GIFSnew · submitted 2019-07-24 · 🧮 math.CO

Sequencing Partial Steiner Triple Systems

Brian Alspach , Donald L. Kreher , Adri\'an Pastine This is my paper

Pith reviewed 2026-05-24 16:31 UTC · model grok-4.3

classification 🧮 math.CO

keywords partial Steiner triple systemsequenceablepoint-disjoint blocksSteiner triple systemcombinatorial designsequencing

0 comments

The pith

A partial Steiner triple system with at most three point-disjoint blocks is sequenceable.

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

The paper shows that any partial Steiner triple system with at most three point-disjoint blocks admits a sequencing of its points. A sequencing is a linear ordering of all points where no proper prefix of the ordering is the union of the points in some set of point-disjoint blocks. This condition ensures that the sequence does not close on a subcollection of blocks too early. Readers interested in combinatorial designs would care because the result guarantees the existence of such orderings under a bound on the number of mutually disjoint blocks.

Core claim

We prove that if a partial Steiner triple system has at most three point-disjoint blocks, then it is sequenceable. A partial Steiner triple system of order n is sequenceable if there is a sequence of length n of its distinct points such that no proper segment of the sequence is a union of point-disjoint blocks.

What carries the argument

The sequencing condition on the points of the partial Steiner triple system, which requires that no proper segment equals the point set of any collection of point-disjoint blocks. The bound of three on the maximum number of such blocks is used to establish existence of the sequence.

If this is right

Any partial Steiner triple system with zero to three mutually point-disjoint blocks admits at least one valid sequencing of its points.
The sequencing exists independently of the total order n of the system.
The guarantee covers all systems whose largest set of point-disjoint blocks has size at most three.

Where Pith is reading between the lines

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

The three-block threshold might not be the largest possible value for which sequencing is always possible.
Sequencing could be applied to related ordering problems in triple systems or in decompositions of complete graphs.
Systems with four or more point-disjoint blocks would require separate analysis to determine whether sequencing still holds.

Load-bearing premise

The input collection must satisfy the partial Steiner triple system property that every pair of points appears in at most one block.

What would settle it

A single partial Steiner triple system with three or fewer point-disjoint blocks that admits no sequencing of its points would disprove the claim.

read the original abstract

A partial Steiner triple system of order n is sequenceable if there is a sequence of length n of its distinct points such that no proper segment of the sequence is a union of point-disjoint blocks. We prove that if a partial Steiner triple system has at most three point-disjoint blocks, then it is sequenceable.

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 proves partial Steiner triple systems with at most three point-disjoint blocks are sequenceable, via direct case analysis on matching size.

read the letter

The paper proves that any partial Steiner triple system whose largest set of point-disjoint blocks has size at most three admits a sequencing: an ordering of the points so that no proper prefix is the point set of some collection of mutually disjoint blocks. The argument splits into cases on the matching number k from 0 to 3 and supplies explicit orderings or inductive constructions that use the partial linear-space property (pairs in at most one triple) to block forbidden segments. This bound of three is the concrete new statement; earlier work apparently handled smaller k, and the authors reach the next natural threshold with the same method. The constructions are tied directly to the axioms, which keeps the logic local and checkable. The soft spots are the usual ones for case analysis in design theory. The k=3 case requires verifying that all possible ways three disjoint triples can intersect the remaining system still allow an extension without creating a bad prefix; if any intersection pattern was missed the claim would fail, but the stress-test note indicates the authors tracked the patterns. No circular definitions or fitted parameters appear. The result is aimed at people already working on sequenceable designs or decompositions in triple systems. A reader who knows the standard definitions will see a usable sufficient condition and can test it on small examples or try to push the bound higher. It is not broad enough to interest outsiders, but within combinatorial design theory it is a clean incremental theorem. I would send it to peer review. The claim is precise, the method is standard for the area, and the only real work for a referee is to audit the k=3 case details.

Referee Report

0 major / 2 minor

Summary. The manuscript proves that every partial Steiner triple system whose largest collection of point-disjoint blocks has size at most three is sequenceable: there exists an ordering of the point set such that no proper consecutive segment equals the point set of any collection of mutually disjoint blocks. The argument proceeds by exhaustive case analysis on the size k of a maximum matching (k = 0,1,2,3), supplying explicit constructions or inductive orderings that preserve the partial linear-space axiom that every pair lies in at most one block.

Significance. If the case analysis is complete, the result supplies a concrete existence theorem for sequenceability in partial Steiner triple systems when the matching number is bounded by three. The constructive nature of the orderings for each small-k case is a strength, as is the direct appeal to the defining property of a partial linear space without additional parameters or fitted quantities.

minor comments (2)

[Introduction] The opening paragraph of the introduction would benefit from an explicit numbered definition of 'sequenceable' that matches the wording used in the abstract.
[Section 4] In the k=3 case analysis, the description of how the inductive ordering avoids creating a forbidden segment could be accompanied by a small diagram illustrating the relevant intersection pattern.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for recommending acceptance.

Circularity Check

0 steps flagged

No significant circularity; direct case-analysis proof

full rationale

The manuscript proves an implication (PSTS with maximum point-disjoint blocks ≤ 3 is sequenceable) via exhaustive case analysis on the matching size k = 0,1,2,3, supplying explicit orderings that respect the partial linear-space axiom. No parameter is fitted and then relabeled a prediction, no quantity is defined in terms of the target property, and no load-bearing step reduces to a self-citation or prior ansatz of the same authors. The sequencing definition is independent of the bound k ≤ 3, and the constructions are verified directly against that definition.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The result is a proof that invokes only the standard definitions of partial Steiner triple systems and point-disjoint blocks; no numerical parameters are fitted and no new entities are postulated.

axioms (2)

domain assumption Every pair of distinct points lies in at most one block.
This is the defining property of a partial Steiner triple system invoked in the statement.
standard math Blocks are 3-element subsets.
Standard set-theoretic definition used throughout combinatorial design theory.

pith-pipeline@v0.9.0 · 5564 in / 1213 out tokens · 24785 ms · 2026-05-24T16:31:48.779803+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

A partial Steiner triple system T is sequenceable if the associated poset P(T) is sequenceable. ... no proper segment of π belongs to P
IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Lemma 3.2. Let A be a 6-subset ... partition into two blocks A1 and A2 ... unique
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We prove that if a partial Steiner triple system has at most three point-disjoint blocks, then it is sequenceable

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.