Perfectly packing a cube by cubes of nearly harmonic sidelength

DOI10.4153/s0008439523000140zbMath1522.52036arXiv2204.06038OpenAlexW4320728553MaRDI QIDQ6052812

Rory McClenagan

Publication date: 25 September 2023

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.06038

zbMATH Keywords

packingMosercube packingsquare packingMeir

Mathematics Subject Classification ID

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

Cites Work

• On packing of rectangles in a rectangle
• Perfect packing of \(d\)-cubes
• An algorithm for packing squares
• Compactness theorems for geometric packings
• A note on three Moser's problems and two Paulhus' lemmas
• Perfect packing of cubes
• A note on perfect packing of squares and cubes
• A note on perfect packing of \(d\)-dimensional cubes
• On packing of squares and cubes

This page was built for publication: Perfectly packing a cube by cubes of nearly harmonic sidelength