Metraipolis › archive › dc_acb6ab4e4d4c

Axis-parallel square packing with an exact formula for optimal packing of seven squares — arXiv:2610.22622

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.22622
License (as archived)
CC0-1.0
Archived
2026-10-19T09:39:29.686Z
SHA-256 of the archived text
5ee667a75655fe7bcc907abbeb12121175fea10d58e226d3611d7826d123c810
Stable URL of this page
https://metraipolis.com/documento/dc_acb6ab4e4d4c

How to cite

Axis-parallel square packing with an exact formula for optimal packing of seven squares — arXiv:2610.22622 — arXiv (en), https://arxiv.org/abs/2610.22622 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_acb6ab4e4d4c (Metraipolis archive dc_acb6ab4e4d4c, sha256 5ee667a75655fe7bcc907abbeb12121175fea10d58e226d3611d7826d123c810)
BibTeX
@misc{dcacb6ab4e4d4c,
  title = {Axis-parallel square packing with an exact formula for optimal packing of seven squares — arXiv:2610.22622},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.22622},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_acb6ab4e4d4c; sha256 5ee667a75655fe7bcc907abbeb12121175fea10d58e226d3611d7826d123c810},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22622. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Metric Geometry (math.MG) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.22622 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:34:59.758Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).