The BCC Lattice Maximizes the First Positive Neumann Eigenvalue among 3D Lattice Voronoi Cells
Authors: Kaixin Deng, Senping Luo
Abstract
It is shown that, among three-dimensional lattices of fixed covolume, the body-centered cubic lattice maximizes the first positive Neumann eigenvalue of its Voronoi cell uniquely, up to orthogonal transformations.
The papers around it, by date and closeness
Higher is closer to this paper; left is older. Lines join papers close to each other: groups of lines are sub-topics. Select a point to see why it is there. Back to the summary of this paper
Papers around this one
Ranked by how close their title and abstract are to this paper’s. Select some to read them together.
Closest papers
-
The BCC lattice is the optimal 3D lattice quantizer for all $p\geq1$Senping Luo · 2026 · Analysis of PDEs · cited 1 time · AI summary available
The paper proves BCC optimality for Voronoi-cell moment minimization, while this paper proves BCC optimality for the first positive Neumann eigenvalue.
In short
For every finite p ≥ 1, the body-centered cubic lattice uniquely minimizes the Voronoi-cell pth moment among three-dimensional lattices of covolume one, up to orthogonal transformations.
-
BCC optimality for the three-dimensional Coulomb lattice energyC. Muratov, M. Novaga · 2026 · cited 1 time · Not summarized yet
This paper establishes BCC optimality for Coulomb energy among fixed-covolume lattices, rather than for a Voronoi-cell eigenvalue.
Abstract
We prove that the body-centered cubic lattice uniquely minimizes the renormalized Coulomb energy among three-dimensional Bravais lattices of fixed covolume, up to orthogonal transformations. Using Ewald summation, we write the energy, to within an additive constant, as a sum of two positive, rapidly convergent series in real and reciprocal space. Their positivity provides finite lower bounds for all competitors. A passage to the dual lattice reduces the problem to a face-centered cubic comparison. A short basis vector estimate, a certified local Hessian, and interval bounds on a compact five-dimensional domain complete the computer-assisted proof.
-
Optimality of the BCC lattice among 3D lattice quantizersD. Bourne, F. Cagnetti, S. M. Roper · 2026 · cited 1 time · Not summarized yet
This paper studies BCC optimality for lattice quantization through Voronoi-cell moments, not Neumann eigenvalues.
Abstract
We study the problem of the best approximation (w.r.t. the optimal transport metric $W_p$, $p \in [1,\infty)$) of the three-dimensional Lebesgue measure on a domain of volume 1 by a discrete probability measure supported on a Bravais lattice. This problem is known as the quantization problem and it arises in numerical integration, electrical engineering, discrete geometry and materials science. As the lattice size tends to zero and the cardinality of the support of the discrete measure tends to infinity, this reduces to the following geometric optimization problem: Amongst three-dimensional Bravais lattices with determinant $1$, which lattice minimises the $p$-th moment of the lattice Vorono…
-
Low-dimensional lattices. VI. Voronoi reduction of three-dimensional latticesJ. Conway, N. Sloane · 1992 · Proceedings of the Royal Society of London. Series A, Mathematical and physical sciences · cited 91 times · Not summarized yet
This work develops Voronoi reduction for three-dimensional lattices, a framework used to describe the lattice cells being compared.
-
Maximizing the fundamental Laplace--Neumann eigenvalue on quadrilateralsRyoki Endo, Braxton Osting · 2026 · cited 3 times · Not summarized yet
This paper maximizes the first Neumann eigenvalue among equal-area quadrilaterals, using Rayleigh–Ritz bounds and a symmetry-reduced Hessian.
Abstract
We prove that among convex planar quadrilaterals of equal area, the square uniquely maximizes the first nonzero Laplace--Neumann eigenvalue. This is the quadrilateral case of the Neumann analogue of the long-standing P\'olya--Szeg\H{o} conjecture, which asserts that the regular $n$-gon minimizes the first Laplace--Dirichlet eigenvalue among $n$-gons of equal area. The proof uses a Rayleigh--Ritz lower bound, obtained from the span of the first five nonconstant Neumann modes of the square, on a smooth auxiliary functional whose minimization implies the original maximization. Local maximality at the square follows from a symmetry-reduced Hessian, computed in closed form, together with a certif…
-
A variational principle for Gaussian lattice sumsLaurent Bétermin, Markus Faulhuber, Stefan Steinerberger · 2026 · Forum of Mathematics, Pi · Not summarized yet
This paper studies an extremal Gaussian lattice sum in two dimensions, with the hexagonal lattice as optimizer rather than a three-dimensional Neumann eigenvalue.
Abstract
Abstract We consider a two-dimensional analog of Jacobi theta functions and prove that, among all lattices Λ⊂R2 $\Lambda \subset \mathbb {R}^2$ normal upper Lamda subset of double struck upper R squared with fixed density, the minimal value is maximized by the hexagonal lattice. This result can be seen as the inhomogeneous counterpart to Montgomery’s 1988 result, which proved that the hexagonal lattice minimizes the maximum.
-
Uniqueness of the hexagonal lattice's universal optimalityMarkus Faulhuber, P. Petersen · 2026 · Not summarized yet
This paper proves uniqueness of the planar hexagonal lattice's universal optimality, not optimality for a three-dimensional Voronoi-cell eigenvalue.
Abstract
We build on a recent proof of the universal optimality of the planar hexagonal lattice. We extend this result to demonstrate that, up to Euclidean motion, the hexagonal lattice is the only periodic configuration with this property.
-
The Optimal Lattice Quantizer in Three DimensionsE. S. Barnes, N. Sloane · 1983 · Siam Journal on Algebraic and Discrete Methods · cited 109 times · Not summarized yet
This work concerns the optimal three-dimensional lattice quantizer, a Voronoi-cell optimization problem distinct from maximizing a Neumann eigenvalue.
Prior work it builds on
-
An optimal Poincaré inequality for convex domainsL. Payne, H. Weinberger · 1960 · Archive for Rational Mechanics and Analysis · cited 860 times · Not summarized yet
This work provides an optimal Poincaré inequality for convex domains, relevant background for bounds on Neumann eigenvalues.
-
Inequalities for Certain Eigenvalues of a Membrane of Given AreaG. Szegő · 1954 · Indiana University Mathematics Journal · cited 335 times · Not summarized yet
This work concerns inequalities for membrane eigenvalues at fixed area, a broader spectral-optimization setting than lattice Voronoi cells.
-
Centroidal Voronoi Tessellations: Applications and AlgorithmsQ. Du, V. Faber, M. Gunzburger · 1999 · SIAM Review · cited 2,493 times · Not summarized yet
This work presents algorithms and applications for centroidal Voronoi tessellations, a generic Voronoi-cell resource.
-
An Isoperimetric Inequality for the N-Dimensional Free Membrane ProblemH. Weinberger · 1956 · Indiana University Mathematics Journal · cited 315 times · Not summarized yet
This work studies an isoperimetric inequality for free-membrane eigenvalues, a broader spectral optimization topic.
-
Two-Sided Bounds for Eigenvalues of Differential Operators with Applications to Friedrichs, Poincaré, Trace, and Similar ConstantsI. Šebestová, T. Vejchodský · 2013 · SIAM Journal on Numerical Analysis · cited 46 times · Not summarized yet
This paper gives a general method for guaranteed two-sided eigenvalue bounds, which is used for spectral certification in the study.
Abstract
We present a general numerical method for computing guaranteed two-sided bounds for principal eigenvalues of symmetric linear elliptic differential operators. The approach is based on the Galerkin method, on the method of a priori--a posteriori inequalities, and on a complementarity technique. The two-sided bounds are formulated in a general Hilbert space setting and as a byproduct we prove an abstract inequality of Friedrichs--Poincare type. The abstract results are then applied to Friedrichs, Poincare, and trace inequalities and fully computable two-sided bounds on the optimal constants in these inequalities are obtained. Accuracy of the method is illustrated in numerical examples.
Go further
How are these papers found?
We compare the title and abstract of this paper with those of every paper summarized on this site, and with the papers Semantic Scholar recommends, those it cites and those citing it (for a much-cited paper, its most recent citations and, from OpenAlex, the most cited ones). Among the prior work and the follow-ups, the papers that use each other in depth, a method it uses and the much-cited follow-ups come a little higher. The levels (very close, close, related) come from the similarity of the texts, not from a judgment of quality; * marks a paper without an abstract, compared by its title. The sentence under a paper is written by an AI from the two abstracts: check it in the papers. A paper marked not relevant by three readers leaves the list.
Updated on 16 November 2026.