Paperlane

no. 13 · Wednesday 11 November 2026

Axis-parallel square packing with an exact formula for optimal packing of seven squares

Matthew Badger

math.MG · v2 · 24 pp

Abstract

How large a square is needed to hold axis-parallel squares of prescribed side lengths? We give exact formulas for the optimal side through seven squares, with explicit constructions and geometric lower-bound proofs. For every $n\ge6$, the optimum for $n$ squares is a sum of at most $n-3$ of the prescribed side lengths. This bound is sharp on an open set of side lengths and yields the optimal Euclidean Lipschitz constant $\sqrt{n-3}$ of the optimum as a function of the $n$ side lengths.

comments
v1: 24 pages, 6 figures (v2: strengthened Lemma 2.1 and Equation (2.5), streamlined several proofs)
fields
Metric Geometry, Combinatorics
pdf ↗ page arXiv:2610.22622 ↗