Another Better Lower Bound for N=17 Square Packing
This article discusses a new mathematical proof for the square packing problem, specifically focusing on the lower bound for packing 17 unit squares. It includes a technical breakdown of the geometric constraints and a Python code snippet used to verify the proposed lower-bound certificate.
Why it matters
Advancements in packing problems have significant implications for optimization theory, logistics, and computational geometry.
The idea is to improve a recent result and prove that 4.5058 (?) ≤s(17) using these weights:
The idea of the old proof (19+40*sqrt(2))/17≅4.4452…≤s(17) of Trevor Green is to pick 16 very interesting "unavoidable" points in a square of side 4.4452… and then he uses a lot of geometry to prove that any unit square must include at least one of them. So if we try to fit 17 unit squares there, at least two unit squares must share one of the 16 interesting points. The construction chooses 16 points out of a 4x6 grid.
Get smarter about the news
Sign up free for a feed built around what you actually care about, Dive Deeper research on any story, and the full text of every article.
Create free accountAlready have an account? Sign in