Open Source
Optimality of the $D_4$ lattice quantizer
arXiv math.IT0 views
arXiv:2611.00100v2 Announce Type: replace-cross Abstract: We prove that the root lattice $D_4$ uniquely minimizes the normalized second moment among four-dimensional lattices, up to similarity. The minimum is $13/(120\sqrt{2})$. The proof reduces the problem to polynomial inequalities on three secondary cones. We derive the second-moment formulas geometrically and give explicit polynomial certificates that can be checked by coefficient comparison. We also derive a lower bound for lattice quantizers in every dimension at least two from the number of Voronoi facets, using a comparison with circular cones and concavity in the solid angle. This bound strictly improves the sphere bound and recovers the hexagonal value in dimension two.
Source:https://arxiv.org/abs/2611.00100PreviousSeed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov BoundNextCyclotomic polynomials with trinomial irreducible factors over finite fields
Related posts
The intrusion-detection rule that could never fire
0dev.to
Kira Systems targets 90% accuracy. The catch? No public price.
0dev.to AI
Granite Guardian vs guardrails proprietários
0dev.to Security

AI Code Governance Policy for Copilot, Cursor and Claude Code in 2026: One Rule, Three Agents
0dev.to DevOps
Rocky Linux introduces Testrarc, with public testing results of new releases
0dev.to DevOps
Fast-Ruby: Writing Fast Ruby – Collect Common Ruby Idioms
0Hacker News New