A general inequality for packings of boxes

Publication date 20 April 2018

Partitions of sets (05A18) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Abstract: Keller packings and tilings of boxes are investigated. Certain general inequality measuring a complexity of such systems is proved. A straightforward application to the unit cube tilings is given.

This page was built for publication: A general inequality for packings of boxes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6300581)