Steiner quadruple systems with minimum colourable derived designs at the orders 38, 44, 62, 74, 86 and 92
Abstract
A Steiner quadruple system SQS(v) has minimum colourable derived designs — it is an mcDSQS(v), in the terminology of Tan and Zhou — when the derived Steiner triple system at every one of its v points partitions into the least possible number of partial parallel classes. For v ≡ 2 (mod 6) that number is v/2, and the existence of an mcDSQS(n) for all n ≡ 2 (mod 6), n ≥ 20, is Conjecture 2 of Shi, Xia and Krotov, where it is equivalent to a statement about diameter perfect constant-weight codes. The published orders are 20, 26, 32 and 2 · 9ᵐ+2; Tan and Zhou ask, as the first of their open problems, for an mcDSQS(38). We construct an mcDSQS(v) for v = 38, 44, 62, 74, 86, 92, two designs at each order, and prove the defining property for all v points of each. Every design is cyclic, and no novelty is claimed on the design side: the cyclic SQS(v) spectrum below 100 is settled in the literature apart from v=94. The new content is the colouring. Order 74 is the value at n=1 of the family 18 · 4ⁿ+2, for which Tan and Zhou pose a separate open problem. The colourings were found by an encoding that makes explicit a second exact cover hidden in the problem: since each point of an STS(n-1) is missed by exactly one class of a minimum colouring, a minimum colouring is a pair of coupled exact covers, and every earlier method we tried left the second one implicit. Making it explicit turns instances on which a local search of 1.2 million moves stalls into instances a SAT solver closes in seconds, and removes the need for any symmetry restriction at all. We also record two structural consequences: none of the minimum colourings found here has the "Hanani" class-size profile, and at orders 38 and 74 two of our designs realise different profiles, so the profile is not an invariant of the order. 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
732a5823044c032827a2a06047eaf2247dbb54a9a99cbfe1f80569a5b753d0df
Claim ledger
Stated results
MCDSQS-1candidate2026-08-23
An mcDSQS(44) exists – the smallest open order of Shi-Xia-Krotov Conjecture 2 after 38
MCDSQS-2routine2026-08-22
The 38 recipe does not transport: no cyclic SQS(44) admits an order-10 multiplier
MCDSQS-3known2026-08-22
chi'(43) = 22 kernel-checked
MCDSQS-4routine2026-08-22
A cyclic SQS(50) with multiplier x->11x, verified
MCDSQS-5routine2026-08-22
n = 50 is provably blocked for the sigma-equivariant colouring method; the general slack criterion F*f = F + 3K
MCDSQS-6routine2026-08-22
A cyclic SQS(62) with multiplier x -> 33x (order 5), verified; chi'(61) >= 31
MCDSQS-7routine2026-08-22
A cyclic SQS(74) with an order-6 multiplier group <27>; chi'(73) >= 37
MCDSQS-8routine2026-08-22
The slack criterion passes at 62 and 74 yet the equivariant walk stalls (walk stalled, non-existence NOT proved)
SQS38-1known data2026-08-22
Tan-Zhou's cyclic mcDSQS(26): their 27 base blocks develop to an SQS(26), their 13 classes colour the derived design at every point, and 13 is optimal
SQS38-2known data2026-08-22
The published SQS(38) (Sage _SQS38, from the La Jolla repository) is a Steiner quadruple system, and it is cyclic with multiplier 7
SQS38-3routine2026-08-22
Any SQS(38) needs at least 19 colours on every derived design; the published one attains 20, bracketing its derived chromatic index to 19, 20
SQS38-4known2026-08-22
The open problem: does an mcDSQS(38) exist? Stated in Lean, not decided
SQS38-5routine2026-08-22
Kernel-only validation of the predicate on SQS(8) and SQS(10), with corrupted data, wrong orders and weakened definitions all rejected
S-mcdsqs38candidate2026-08-23
An mcDSQS(38) exists – the smallest open case of Shi-Xia-Krotov Conjecture 2, and Tan-Zhou Problem (1)
MCDSQS-9candidate2026-08-28
An mcDSQS(62) exists – Shi-Xia-Krotov Conjecture 2 at n = 62, the order this family left open on 2026-08-22
MCDSQS-10candidate2026-08-28
An mcDSQS(74) exists – Shi-Xia-Krotov Conjecture 2 at n = 74
MCDSQS-11candidate2026-08-28
An mcDSQS(86) exists – Shi-Xia-Krotov Conjecture 2 at n = 86, design and colouring both new
MCDSQS-12candidate2026-08-28
An mcDSQS(92) exists – Shi-Xia-Krotov Conjecture 2 at n = 92; the first order of the campaign with a forced quarter orbit
MCDSQS-13routine2026-08-28
A near-linear decision procedure for IsSQS, proved equivalent to the repository's quadratic one
MCDSQS-14routine2026-08-28
The minimum-colouring deficiency profile is neither Hanani nor an invariant of the order
This ledger entry is reported in prose and is not bound to a Lean theorem.Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- Shi-Xia-Krotov Conjecture 2 (arXiv:2212.00048): an mcDSQS(n) exists for every n = 2 (mod 6), n >= 20. This family runs that conjecture order by order, from v = 38 — the smallest case that was open, and Tan-Zhou's Problem (1) — up through 44, 50, 62 and 74. Orders 38 and 44 are settled here; 50 is proved blocked for the colouring method used; at 62 and 74 the design half landed and the colouring half did not.
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7