Tight single-change covering designs at small orders: exact counts and unconditional non-existence
Abstract
A tight single-change covering design tsccd(v,k) is an ordered sequence of k-subsets of {1,…,v} in which each block after the first is obtained from its predecessor by removing one point and inserting another, every pair of points occurs together in some block, and the point inserted at each step has never before shared a block with any of its new block-mates. Preece asked at the Nineteenth British Combinatorial Conference for such a design with block size greater than five, and Bean's tsccd(26,6) answers that question. We settle several small orders exactly. There are exactly 32 standardised tsccd(7,3); we have found no source that states this number, the standard survey printing six representatives and no total. There are exactly 1440 tight single-change covering designs on six labelled points with block size three, and there is no tsccd(6,4) and no tsccd(7,4) at all — with no canonical form assumed anywhere. At five further orders, (9,4), (10,4), (11,6), (12,5) and (10,6), no standardised design exists. What makes these statements about designs rather than about a program is a completeness theorem for the enumeration procedure, proved with no computation, together with a proof of the counting identity C(v, 2)=C(k, 2)+(b-1)(k-1) for all parameters, which forces the number of blocks and yields congruence obstructions ruling out a positive proportion of orders with no search at all. We also record a verification, inside the proof kernel, of Bean's design and of every statistic published about it. All statements are machine-checked in Lean 4.
Open review
This founding-collection manuscript received AI review before publication. Independent human review is open. Submitted reviews enter editorial screening; submitting a review does not change this paper’s status. Contribute an assessment of specific claims, a reproduction, or a correction for editorial screening.
Archived files
- Version 1 · current (opens in a new tab)
Source snapshot 2026-08-30 15:34 UTC
File fingerprint
a23fad9834853de6945698c0f2861aca10ff0a698325124a94aaf98d514d75d2
Claim ledger
Stated results
T1known data2026-08-23
The tsccd(26,6) of arXiv:2607.10978 exists: BCC Problem 1 answered, kernel-checked
T2known data2026-08-23
Every number the paper states about its design: b = 63, T = 68, (t1,t2,t3,t4) = (6,5,8,7), six anchors, three persistent pairs, front-loaded
T3known data2026-08-23
The tsccd(7,3) printed inside BCC Problem 1, and the two tsccd(6,3)'s the 1995 survey proves are the only standardised ones
T4routine2026-08-23
Designs at (10,3), (11,3) and (12,4) found here; v = 12 is the least order admitting a k = 4 design
T5routine2026-08-23
The admissibility criteria of the 1995 survey and of arXiv:2607.10978, reproduced – including that the paper's two stated criteria leave v = 10 and its unstated third removes it
T6candidate2026-08-23
Exhaustive cells: exactly 2 standardised tsccd(6,3), exactly 32 standardised tsccd(7,3), and none at (6,4), (7,4), (9,4), (10,4), (11,6), (12,5), (10,6)
T7routine2026-08-23
Negative controls: 62 blocks do not cover, 64 cannot stay tight, a one-block perturbation breaks single change, and standardisation and front-loading are both non-vacuous
T8known2026-08-28
The counting identity C(v,2) = C(k,2) + (b-1)(k-1) for every tight single-change covering design, and the block count it forces
T9known2026-08-28
Infinitely many non-existence theorems with no search: a non-admissible (v,k) admits no design, and the forced congruences v = 2,3 (mod 4) for k=3, 0,1 (mod 3) for k=4, 4,5 (mod 8) for k=5, 0,1 (mod 5) for k=6
T10routine2026-08-28
The enumerator of Search.lean is complete: every standardised tsccd(v,k) is on stdSearch v k
T11routine2026-08-28
No tight single-change covering design in standardised form at (6,4), (7,4), (9,4), (10,4), (11,6), (12,5), (10,6) — the seven empty cells, no longer "over a stated space"
T12candidate2026-08-28
Exactly 32 standardised tsccd(7,3) and exactly 2 standardised tsccd(6,3) — counts of a set of designs, not of a search's output
T13routine2026-08-28
The sources' standardisation implies the enumerator's, for every tight single-change covering design
T14routine2026-08-28
No tsccd(6,4) and no tsccd(7,4) at all, and exactly 1440 tsccd(6,3) – the three cells where every first block can be enumerated, with no canonical form assumed
Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- Tight single-change covering designs, and the block-size-6 design that answers a twenty-five-year-old named open problem.
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7