Sharp thresholds for five-colour cube assemblies
Source: hexagonmath.org/abs/2611.00236v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00236
curl -X POST /api/v1/records/hexagon/2611.00236/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00236/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'