Another better lower bound for n=17 square packing
gus_massa
27 points
6 comments
August 21, 2026
Related Discussions
Found 5 related stories in 76.0ms across 4,128 title embeddings via pgvector HNSW
- New Lower and Upper Bounds for the Grothendieck Constant surprisetalk · 44 pts · August 14, 2026 · 46% similar
- The beautiful mathematics behind OpenAI's sphere packing result brandonb · 14 pts · August 17, 2026 · 45% similar
- Some combinatorial applications of spacefilling curves shraiwi · 12 pts · July 25, 2026 · 42% similar
- Show HN: Dozenal – A Game of Spatial Arithmetic sarreph · 15 pts · July 27, 2026 · 35% similar
- Show HN: Formally verified 3D CSG: Trust 93 lines spec, not 1000 lines AI code permute · 108 pts · July 28, 2026 · 34% similar
Discussion Highlights (4 comments)
scuppernong
Some of these point arrangements superficially resemble Chladni figures ( https://chalkdustmagazine.com/regulars/on-the-cover/cover-ch... ) coming from the vibrations of a square drum. Orthogonally, I wonder if these arrangements are generalizable to give lower bounds for N = n^2 + 1
teddyh
None of the images has any squares.
dist-epoch
The n=17 case is a famous math meme. But where is the picture for this lower bound packing?
dooglius
Responding to a couple comments here: there is no picture or new arrangement of squares because those are _upper_ bounds for the problem. The best known arrangement, i.e. the best known upper bound, has not changed.