Optimal packings of unit squares in a square

MaRDI QIDQ2714344zbMATH OpenFDO

Authors S. El Moumni

Publication date 13 June 2001

Published in Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

zbMATH Keywords

packingsquares

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Review text

Let \(s(n)\) denote the minimal possible side length of a square in which \(n\) unit squares can be packed without intersection in interior points. Apart from the trivial equality \(s(k^2)=k\), a few values of \(s(n)\) are known. In the paper under review, the author proves that \(s(7)=3\) (implying that \(s(8)=3\)) and \(s(15)=4\).

Recommendations

• Packing unit squares in squares: A survey and new results
• On packing squares with equal squares
• scientific article; zbMATH DE number 1226257
• Improved packings of \(n(n - 1)\) unit squares in a square
• Optimal packings of 13 and 46 unit squares in a square

Cited in

(10)

• Optimal packings of unit squares in an infinite strip
• Packing unit squares in squares: A survey and new results
• On optimal piercing of a square
• Expected wasted space of optimal simple rectangle packing
• Packing 10 or 11 unit squares in a square
• Optimal packings of 13 and 46 unit squares in a square
• Valid constraints for the Point Packing in a Square problem
• Improved packings of \(n(n - 1)\) unit squares in a square
• A Square-Packing Problem of Erdoes
• Efficient packing of unit squares in a square

This page was built for publication: Optimal packings of unit squares in a square

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2714344)