Optimal packings of 13 and 46 unit squares in a square
type: Item
instance of: scholarly article
title: Optimal packings of 13 and 46 unit squares in a square
zbMATH Open document ID: 1277.52018
author: Wolfram Bentz
published in: The Electronic Journal of Combinatorics
publication date: 2010-10-13T00:00:00Z
full work available at URL: v17i1r126.html
review text: Summary: Let \(s(n)\) be the side length of the smallest square into which \(n\) non-overlapping unit squares can be packed. We show that \(s(m^2 - 3) = m\) for \(m = 4, 7\), implying that the most efficient packings of 13 and 46 squares are the trivial ones.
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 5799454
MaRDI profile type: Publication
Recommended article: Optimal packings of unit squares in a square
Recommended article: Efficient packing of unit squares in a square
Recommended article: Efficient packings of unit squares in a large square
Recommended article: Optimal packings of unit squares in an infinite strip
Recommended article: Improved packings of \(n(n - 1)\) unit squares in a square
Recommended article: Packing unit squares in squares: A survey and new results
Recommended article: On packings of squares and rectangles
Recommended article: Q5044449
Recommended article: Perfect square packings
description: scientific article; zbMATH DE number 5799454