Sciweavers

Share
COMBINATORICS
2002

Efficient Packing of Unit Squares in a Square

9 years 11 months ago
Efficient Packing of Unit Squares in a Square
Let s(N) denote the edge length of the smallest square in which one can pack N unit squares. A duality method is introduced to prove that s(6) = s(7) = 3. Let nr be the smallest integer n such that s(n2 + 1) n + 1/r. We use an explicit construction to show that nr 27r3 /2+O(r2 ), and also that n2 43.
Michael J. Kearney, Peter Shiu
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2002
Where COMBINATORICS
Authors Michael J. Kearney, Peter Shiu
Comments (0)
books