A simple method for perfect packing of squares of sidelengths n^-1/2-
From MaRDI portal
Publication:6169837
A packing of a rectangle \(R\) by a family (finite or infinite) of squares \(Q_1, Q_2, \dots\) is called \textit{perfect} if the area of \(R\) equals the sum of these squares. Following a historic survey of the existing results on almost perfect packing, the author provides a simple method for perfect packing a square by squares of side lengths \(1, 2^{-t}, 3^{-t}, 4^{-t}, \dots\).
Recommendations
Cites work
- A note on perfect packing of squares and cubes
- A note on three Moser's problems and two Paulhus' lemmas
- An algorithm for packing squares
- On packing of squares and cubes
- On packing unequal squares
- On packings of squares and rectangles
- Perfect packings of squares using the stack-pack strategy
- Perfect square packings
- Problems, problems, problems
Cited in
(12)- Perfect packings of squares using the stack-pack strategy
- Perfect packing of cubes
- Perfect square packings
- A note on perfect packing of squares and cubes
- Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
- A problem on packing a square with sequence of squares
- PERFECT PACKING OF SQUARES
- Perfectly packing a square by squares of nearly harmonic sidelength
- Perfect packing by convex and concave polygons
- Perfectly packing an equilateral triangle by equilateral triangles of sidelengths \(n^{-1/2-\epsilon }\)
- Packing isosceles right triangles of legs of harmonic lengths
- Slack-pack algorithm for Meir-Moser packing problem
This page was built for publication: A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169837)
