Optimal packings of unit squares in a square (Q2714344)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal packings of unit squares in a square |
scientific article; zbMATH DE number 1604251
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal packings of unit squares in a square |
scientific article; zbMATH DE number 1604251 |
Statements
13 June 2001
0 references
packing
0 references
squares
0 references
Optimal packings of unit squares in a square (English)
0 references
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\).
0 references
