A note on perfect packing of squares and cubes

DOI10.1007/s10474-020-01114-6zbMath1474.52026OpenAlexW3129159089MaRDI QIDQ2036608

Janusz Januszewski, Łukasz Zielonka

Publication date: 29 June 2021

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10474-020-01114-6

zbMATH Keywords

cubessquareperfect packing

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (5)

Perfectly packing a cube by cubes of nearly harmonic sidelength ⋮ Filling space with hypercubes of two sizes – The pythagorean tiling in higher dimensions ⋮ Perfectly packing a square by squares of sidelength \(f(n)^{-t}\) ⋮ A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\) ⋮ Parallel packing squares into a triangle

Cites Work

• An algorithm for packing squares
• Perfect packings of squares using the stack-pack strategy
• A note on three Moser's problems and two Paulhus' lemmas
• Perfect packing of cubes
• Perfect square packings
• On packing unequal squares
• On packing of squares and cubes

This page was built for publication: A note on perfect packing of squares and cubes