Improved packings of n(n - 1) unit squares in a square

DOI10.37236/8586MaRDI QIDQ2665963zbMATH OpenOpenAlexFDO

Authors M. Z. Arslanov, S. A. Mustafin, Z. K. Shangitbayev

Publication date 22 November 2021

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.37236/8586

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

packingssquareunit squares

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Review text

Summary: Let \(s(n)\) be the side of the smallest square into which we can pack \(n\) unit squares. The purpose of this paper is to prove that \(s(n^2-n)<n\) for all \(n\geq 12\). Besides, we show that \(s(18^2-17) < 18, s(17^2-16) < 17,\) and \(s(16^2-15) < 16\).

Recommendations

• Packing unit squares in squares: A survey and new results
• On packing squares with equal squares
• Efficient packings of unit squares in a large square
• Optimal packings of unit squares in a square
• Packing unit squares in a rectangle

Cites work

• On packing squares with equal squares
• Packing unit squares in a rectangle
• Packing unit squares in squares: A survey and new results

Cited in

(4)

• Packing unit squares in squares: A survey and new results
• Optimal packings of 13 and 46 unit squares in a square
• Efficient packings of unit squares in a large square
• Optimal packings of unit squares in a square

This page was built for publication: Improved packings of \(n(n - 1)\) unit squares in a square

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