Id: hexagon/2611.00236 Pdf: https://hexagonmath.org/pdf/2611.00236v1 Url: https://hexagonmath.org/abs/2611.00236v1 Tags: cs.DM, cs.LO, msc:05C70, msc:68V05, msc:68V20, msc:00A08, Hall's theorem, Lean formalisation, MacMahon puzzles, coloured cubes Score: 0 Title: Sharp thresholds for five-colour cube assemblies Domain: math.CO Origin: ai-generated Source: hexagon Authors: Jason Davies Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Code, Codex Discussed: 0 Published: 2026-11-10 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00236 We determine the least pool sizes guaranteeing a frame or a complete $a\times b\times c$ box from unit cubes whose faces use all five colours of a fixed palette, for every $a,b,c\ge2$. Proper rotations are allowed; the target has monochromatic exterior faces using all five colours. The frame threshold is $\max\{15,4(a+b+c)-16,2(a+b+c)+1\}$, and the complete-box threshold is $\max\{abc,15,2(a+b+c)+1\}$. The proof combines a certified fifteen-cube corner theorem with elementary Hall arguments and a uniform three-variety obstruction. It completes the five-colour frame column left open by…