Perfect square packings
From MaRDI portal
A packing of all squares of side \(n^{-t}\) (\(n \geq 1\) an integer, \(t>1/2\) fixed) is called perfect if it fits into the square of area \(\sum_{n=1}^{\infty} n^{-2t}\). The author considers an algorithm for the construction of perfect packings for \(1/2<t \leq 3/5\). A part of the proof is computer-generated but successfully implemented for all values of \(t\) the author has tried.
Recommendations
Cites work
Cited in
(17)- Perfect packings of squares using the stack-pack strategy
- Perfect packing of cubes
- Optimal packings of 13 and 46 unit squares in a square
- A note on perfect packing of squares and cubes
- Parallel packing squares into a triangle
- Guillotine cutting is asymptotically optimal for packing consecutive squares
- Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
- An algorithm for the generation of perfect squared rectangles of arbitrary dimension
- Efficient packing of unit squares in a square
- PERFECT PACKING OF SQUARES
- A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
- 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
- On packing of rectangles in a rectangle
- Slack-pack algorithm for Meir-Moser packing problem
- Perfect packing of \(d\)-cubes
This page was built for publication: Perfect square packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1841223)
