Optimal Packing of Eleven Unit Squares: The Formalized Voronoi-Cell Proof
Source: hexagonmath.org/abs/2611.00359v1
We explain the computer-assisted proof that eleven independently rotated unit squares require a square container of side at least T = 3.8770835900228141773 . . ., the side attained by the known construction attributed to Walter Trump. The proof reduces arbitrary packings to 2,184 patterns of occupied closed Voronoi cells. Exact geometric certificates exclude 2,180 patterns, a square-symmetry argument reduces the remaining four to one, and a complete subdivision of that case places every possible smaller packing inside an explicitly certified isolation neighborhood. We give the geometric…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00359
curl -X POST /api/v1/records/hexagon/2611.00359/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00359/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'