Restricted Schur multiplicity: exact minima and three-block minimisers
Abstract
Fix integers k ≥ 2 and 2 ≤ ℓ ≤ k, and call a solution of x₁ + … + xₖ = xₖ₊₁ in positive integers a solution of level ℓ when its k+1 entries take exactly ℓ+1 distinct values. Let m(k,ℓ;n) be the least number of monochromatic level-ℓ solutions inside [n] = {1,…,n}, minimised over all 2-colourings of [n], solutions being counted as multisets. The level ℓ is Gaiser's, who used it to index a threshold — the restricted generalized Schur number S₂(k;ℓ), the least n forcing one such solution — and who never counts; counting is the Schur-triple multiplicity problem of Graham–Rödl–Ruciński and Robertson–Zeilberger, which does not leave k = 2 and does not restrict the number of distinct values. We compute m(k,ℓ;n) exactly at 74 triples spread over seven pairs (k,ℓ) with k ≤ 5 and n ≤ 55; ten of them, the row k = ℓ = 2, reproduce Robertson–Zeilberger's own objective function and are carried as an external control. At every one of the 74 triples the minimum is attained by a colouring with at most three blocks, [1,a] ∪ (b,n] against (a,b]. We also prove that m(k,ℓ; ·) is non-decreasing; that it is positive exactly from n = S₂(k;ℓ) on, so that the multiplicity function recovers the threshold as its own zero set and re-proves S₂(3;2) = 15, S₂(3;3) = 24 and S₂(4;3) = 35 by a route that runs through no threshold search at all; and that a two-block colouring gives m(k,ℓ;n) = O((n/k)^(ℓ)) for every n. Every statement is machine-checked in Lean 4, except at the few places where we say otherwise; the lower bounds are replays of LRAT refutations of a cardinality-constrained encoding.
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
fc9d5bfb174e082e587bfca74b26b0dcebba7a837632d8ed80d18b573f452b68
Claim ledger
Stated results
M1routine2026-08-28
Statement fidelity: the enumeration of restricted solutions is sound, complete AND duplicate-free, and monoCount counts solutions
M2routine2026-08-28
The count is invariant under swapping the two colours
M3routine2026-08-28
The multiplicity function re-derives the restricted Schur number as its own threshold: m(k,l;n) >= 1 iff n >= S₂(k;l)
M4routine2026-08-28
m(k,l;.) is non-decreasing in n, so one certificate per value replaces one certificate per n
M5routine2026-08-28
The two-interval construction, exact and valid for every n: m(k,l;n) <= #(solutions inside [1,t]) whenever t <= n < k(t+1)
M6routine2026-08-28
The cardinality CNF: a padded power-of-two totalizer with a rectangular variable layout, and its one-directional fidelity proof
M7routine2026-08-28
Negative controls: too-large and too-small claims refuted at both ends of the table, and the count is nowhere near constant
M8routine2026-08-28
Below the threshold the count really is zero
M9known data2026-08-28
Three restricted Schur numbers re-derived through the multiplicity route: S₂(3;2) = 15, S₂(3;3) = 24, S₂(4;3) = 35
M10routine2026-08-28
Why this family owns its enumeration: rest-schur's solList repeats entries, and a count cannot use it
M12candidate2026-08-28
At every one of the 74 computed cells the minimum is attained by a THREE-INTERVAL colouring [1,a] u (b,n] against (a,b]
M20known2026-08-28
m(2,2;n) for n = 9..18 – the external control row
M21candidate2026-08-28
m(3,2;n) = 1,1,1,2,3,3,4,4,4,5,6,7,8,9 for n = 15..28
M22candidate2026-08-28
m(3,3;n) = 1,1,1,2,2,2,3,4,4,5,6 for n = 24..34
M23candidate2026-08-28
m(4,2;n) = 1,1,1,1,2,3,3,3,4,5,5,5,6,7 for n = 24..37
M24candidate2026-08-28
m(4,3;n) = 1,1,1,1,2,3,3,3,4 for n = 35..43
M25candidate2026-08-28
m(4,4;n) = 1 for n = 52, 53, 54, 55
M26candidate2026-08-28
m(5,2;n) = 1,1,1,1,1,2,3,3,3,3,4,5 for n = 35..46
Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- For a 2-colouring c of 1, …, n, let
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7