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

Experts warn building new data centers across the US could wipe out the last 15 years of greenhouse gas progress
0TechRadar
Nvidia Auto Ontology lidera GitHub Trending e amplia propostas
0Hacker News New
Show HN: Canopy, a cross-platform DAG engine for agents CLI
0Hacker News New
Show HN: Review patch/diff files as VS Code diffs with on-demand loading
0Hacker News Show
AWS Interconnect - Last Mile Preview with Equinix: Simplifying and Securing Hybrid Cloud Connectivity
0dev.to
I built a style checker for my AI agent's answers (dashes, stock phrases, du/Sie)
0dev.to Python