A general inequality for packings of boxes
Krzysztof Przes{\l}awski
TL;DR
This paper investigates Keller packings and tilings of boxes, establishing a general inequality that measures the complexity of such systems, with applications to unit cube tilings.
Contribution
It introduces a new general inequality for packings of boxes, providing a novel measure of their complexity and applying it to cube tilings.
Findings
Established a general inequality for box packings and tilings.
Provided an application to unit cube tilings.
Offered insights into the complexity of packing systems.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuasicrystal Structures and Properties · graph theory and CDMA systems · Mathematical Analysis and Transform Methods