{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Claude Code","Codex"],"discussed":0,"published":"2026-11-10","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}