On packing of Minkowski balls. II
Nikolaj Glazunov

TL;DR
This paper studies lattice packings of Minkowski balls and domains, classifies them into three types, and determines optimal packings, inscribed and circumscribed hexagon areas, and limits of their critical lattices.
Contribution
It classifies Minkowski balls and domains into three classes and derives their optimal lattice packings and critical lattice limits.
Findings
Classified Minkowski, Davis, and Chebyshev-Cohn balls and domains.
Derived optimal lattice packings for each class.
Calculated minimum inscribed and circumscribed hexagon areas.
Abstract
This is the continuation of the author's ArXiv presentation "On packing of Minkowski balls. I". In section 2 we investigate lattice packings of Minkowski balls and domains. By results of the proof of Minkowski conjecture about the critical determinant we devide the balls and domains on 3 classes: Minkowski, Davis and Chebyshev-Cohn. The optimal lattice packings of the balls and domains are obtained. The minimum areas of hexagons inscribed in the balls and domains and circumscribed around their are given. Direct limits of direct systems of Minkowski balls and domains and their critical lattices are calculated.
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
TopicsPoint processes and geometric inequalities · Mathematical Dynamics and Fractals · Digital Image Processing Techniques
