arXiv (All)
open access
Axis-parallel square packing with an exact formula for optimal packing of seven squares
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 pres
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A 2.37332-Competitive Algorithm for Online Square Packing with Gravity#997016
- Formally Certifying the Vertex Set of a Polyhedron Faster than Informal Enumeration#1249193
- New mixed cages, bounds and computational results#1324711
- The smallest square tileable by pairwise incomparable integer rectangles#1014129
- On the minimum number of triangles in balanced tripartite graphs with large minimum degree#1034400
Record · ID 1386594
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive