Reinhardt's problem of lattice packings of convex domains: Local extremality of the Reinhardt octagon

DOI10.1007/BF01727653zbMath0664.52012OpenAlexW2088787162MaRDI QIDQ1114938

F. L. Nazarov

Publication date: 1988

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01727653

zbMATH Keywords

lattice packingsplane convex figureminimization of areaReinhardt octagonReinhardt problem

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattices and convex bodies (number-theoretic aspects) (11H06) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31)

Related Items (4)

The 3-ball is a local pessimum for packing ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Pessimal packing shapes ⋮ When is the ball a local pessimum for covering?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über die dichteste gitterförmige Lagerung kongruenter Bereiche in der Ebene und eine besondere Art konvexer Kurven
• On the Lattice Constant of a Symmetric Convex Domain

This page was built for publication: Reinhardt's problem of lattice packings of convex domains: Local extremality of the Reinhardt octagon