On the geometry of nearly orthogonal lattices
Lenny Fukshansky, David Kogan

TL;DR
This paper investigates the geometric and optimization properties of well-rounded nearly orthogonal lattices in high dimensions, revealing their packing density landscape, lattice types they contain, and bounds on minimal vectors.
Contribution
It proves the absence of local maxima for the packing density on nearly orthogonal lattices and shows these sets do not include perfect lattices, highlighting their unique geometric structure.
Findings
Sphere packing density has no local maxima on nearly orthogonal lattices for n≥3.
Nearly orthogonal lattices do not contain any perfect lattices for n≥3.
Such lattices have at most 4n-2 minimal vectors.
Abstract
Nearly orthogonal lattices were formally defined in [4], where their applications to image compression were also discussed. The idea of ``near orthogonality" in -dimensions goes back to the work of Gauss. In this paper, we focus on well-rounded nearly orthogonal lattices in~ and investigate their geometric and optimization properties. Specifically, we prove that the sphere packing density function on the space of well-rounded lattices in dimension does not have any local maxima on the nearly orthogonal set and has only one local minimum there: at the integer lattice~. Further, we show that the nearly orthogonal set cannot contain any perfect lattices for~, although it contains multiple eutactic (and even strongly eutactic) lattices in every dimension. This implies that eutactic lattices, while always critical points of the packing density…
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
TopicsDigital Image Processing Techniques · Mathematical Analysis and Transform Methods · Image and Signal Denoising Methods
