AI summary · arXiv: 2611.18368v1 · math.AP

The BCC Lattice Maximizes the First Positive Neumann Eigenvalue among 3D Lattice Voronoi Cells

Kaixin Deng, Senping Luo
Original paper Submitted to arXiv on 13 Nov. 2026 License: CC BY 4.0 Also in: fr

How to read this summary? Illustrated guide

The essentials

At fixed covolume, the body-centered cubic lattice uniquely maximizes the first positive Neumann eigenvalue among three-dimensional lattice Voronoi cells.

Question

Which three-dimensional lattice Voronoi cell maximizes the first positive Neumann eigenvalue when lattice covolume is fixed? The paper establishes whether the maximizer is unique up to orthogonal transformations.

Method

The authors parametrize unit-covolume lattice shapes using six nonnegative Selling conorms and compare their Voronoi-cell eigenvalues with the equal-conorm BCC case. They prove strict local maximality using transported trial functions and eigenvalue splitting, and establish the global comparison with Rayleigh bounds and a finite interval subdivision with 91,899 accepted boxes. A mixed-boundary spectral computation encloses the BCC eigenvalue between 10.837414 and 10.837456.

Findings

  • Result The BCC lattice uniquely maximizes the first positive Neumann eigenvalue among three-dimensional lattices of covolume one, up to orthogonal transformations.
    See the passage in the paper
    For every full-rank lattice $\Lambda\subset\mathbb{R}^{3}$ of covolume one, (1.5) $$\mu_{1}(V_{\Lambda})\leq\mu_{1}(V_{\mathrm{BCC}}),$$ with equality if and only if $\Lambda=R\mathrm{BCC}$ for some $R\in O(3)$. The maximizing cell is the regular truncated octahedron.
  • Result The BCC Voronoi cell's first positive Neumann eigenvalue is rigorously enclosed between 10.837414 and 10.837456.
    See the passage in the paper
    $$\mu_{1}(V_{\mathrm{BCC}})=2^{4/3}\lambda,\qquad 10.837414<\mu_{1}(V_{\mathrm{BCC}})<10.837456.$$
  • Result The first eigenspace of the BCC cell is three-dimensional, with one axial first mode for each coordinate direction.
    See the passage in the paper
    $$\begin{gathered}\mu_{1}(W)=\lambda,\qquad\ker(-\Delta_{W}^{N}-\lambda)=\operatorname{span}\{u_{1},u_{2},u_{3}\},\\ \int_{W}u_{i}u_{j}=\delta_{ij},\qquad u_{i}(x-2x_{j}e_{j})=(-1)^{\delta_{ij}}u_{i}(x),\\ u_{i}(x)>0\quad(x\in\operatorname{int}W,\ x_{i}>0),\qquad 1\leq i,j\leq 3.\end{gathered}$$
  • Authors’ interpretation The eigenvalue comparison implies the fastest decay of mean-zero insulated heat flow among lattice cells of fixed volume.
    See the passage in the paper
    The decay rate is sharp; Theorem 1.1 gives the fastest decay among lattice cells of fixed volume.

Limitations

  • The result is confined to Voronoi cells of three-dimensional lattices and does not establish a maximizer among arbitrary domains.
  • The authors state that AI assisted the long but finite computations used in the work.
    See the passage in the paper
    The authors used AI to assist the long but finite computations.

Why it matters

The result identifies the unique optimal lattice shape for maximizing the first positive Neumann eigenvalue at fixed covolume, complementing known spectral optimization results for other restricted domain classes. It also establishes the regular truncated octahedron as the optimal lattice Voronoi cell for the fastest mean-zero insulated heat decay.

Written by AI from the paper. Passages are checked word for word against the text we analysed; the rest may contain errors.

AI-generated keywords: Neumann eigenvalue BCC lattice Voronoi cell lattice optimization interval computations

Read further

  • Comprehensive Summary
  • Layman's Summary
  • Blog article
  • Original abstract
The paper asks which three-dimensional lattice, among lattices with the same covolume, has a Voronoi cell with the largest first positive Neumann eigenvalue. This eigenvalue measures the slowest decay rate of mean-zero solutions to the insulated heat equation. Maximizing it therefore identifies the lattice cell with the fastest sharp heat decay at fixed volume. The authors prove that the body-centered cubic (BCC) lattice is the unique maximizer, up to rotations and reflections. Its Voronoi cell is a regular truncated octahedron. The proof combines geometric reduction, spectral estimates, and extensive finite computations. First, the authors use Selling reduction to represent lattice shapes by six nonnegative conorms, normalized so that their sum is one. In these coordinates, they express the Voronoi cell as a centrally symmetric zonotope and derive bounds involving the lattice’s shortest vectors and its dual lattice. A separate geometric estimate compares planar lattice Voronoi polygons with a regular hexagon. These results yield global eigenvalue bounds and help exclude lattices near degenerate shapes. At the equal-conorm point, which represents the BCC lattice, the authors identify the first eigenspace using reflection symmetries. It consists of three modes related by coordinate permutations, and the first eigenvalue is separated from the next one. The authors rigorously enclose this eigenvalue using a polynomial trial function and a flux-based residual estimate on a tetrahedral subdivision. For the unit-volume BCC cell, the resulting bound is 10.837414–10.837456. A separate numerical computation gives 10.8374401273 to ten decimal places. To establish that BCC is a strict local maximizer, the authors transport its three eigenmodes to nearby Voronoi cells and expand their Rayleigh quotients in the conon perturbation. Symmetry and explicit coefficient estimates show that every nonzero perturbation produces a negative direction in the first-order eigenvalue splitting. Bounds on higher-order terms then prove a strict decrease within a specified neighborhood of the equal-conorm point. For the global comparison, the authors reduce the conorm domain using symmetry and subdivide it into boxes. They test these boxes with short-vector bounds, local estimates, and several polynomial Rayleigh trials, including trials adapted to particular lattice configurations. The computations use rational interval enclosures, so the tests certify strict inequalities rather than relying solely on floating-point approximations. The subdivision terminates after 38 levels, with no boxes remaining. Outside the local BCC neighborhood, the method proves an eigenvalue bound below 10.837, while the BCC value exceeds that threshold. Together, the local and global arguments establish uniqueness up to orthogonal transformations. The result applies to three-dimensional lattice Voronoi cells at fixed covolume, not to arbitrary domains or cells arising from non-lattice tilings. Scaling shows that the maximum is proportional to covolume raised to the power \(-2/3\). The proof also relies on extensive specialized computations, for which the authors acknowledge AI assistance. The numerical enclosure and verification procedures support the theorem, but the paper provides neither a simple closed-form eigenvalue nor a broader classification of optimizers beyond the lattice setting.

Was this synthesis useful?

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Tools for this paper

Explain it differently 1 free rewrite left today
Save to a collection Group papers in collections to compare them, chat with them and export them. Continue with Google Create a free account Log in

Advanced tools Premium

For researchers who follow a field closely: citation alerts, journal-club slides, version comparison and Zotero export. Discover Premium

Zotero Zotero guide
Citation alerts Citation alerts guide
Who works on it?

Among the 23 papers around this one, the name that comes back most: N. Sloane (2 papers)

5 more people sign several of them. The full map adds their institutions and approaches, from the papers of the last years.

Continue with Google Create a free account: your first map is free
Weekly letter Presented in "Mathematics and statistics this week" of 16 November 2026. Mathematics and statistics this week: Arithmetic, crystals and the limits of shape · Receive one by email for free

Papers around this one

See them on a map

Ranked by how close their title and abstract are to this paper’s. Select some to read them together.

Closest papers

  1. Very close Broader context Cited by this paper
    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.

  2. Close Broader context
    BCC optimality for the three-dimensional Coulomb lattice energy
    C. 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.

  3. Close Broader context
    Optimality of the BCC lattice among 3D lattice quantizers
    D. 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…

  4. Close* Groundwork for this paper Cited by this paper
    Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
    J. 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.

  5. Close Another approach to the problem Cited by this paper
    Maximizing the fundamental Laplace--Neumann eigenvalue on quadrilaterals
    Ryoki 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…

  6. Close Broader context
    A variational principle for Gaussian lattice sums
    Laurent 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.

  7. Related Broader context
    Uniqueness of the hexagonal lattice's universal optimality
    Markus 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.

  8. Related* Broader context Cited by this paper
    The Optimal Lattice Quantizer in Three Dimensions
    E. 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

  1. Related* Groundwork for this paper Used in depth by this paper
    An optimal Poincaré inequality for convex domains
    L. 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.

  2. Related* Broader context
    Inequalities for Certain Eigenvalues of a Membrane of Given Area
    G. 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.

  3. Related* Shared data, tool or method
    Centroidal Voronoi Tessellations: Applications and Algorithms
    Q. 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.

  4. Related* Broader context
    An Isoperimetric Inequality for the N-Dimensional Free Membrane Problem
    H. 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.

  5. Related Shared data, tool or method
    Two-Sided Bounds for Eigenvalues of Differential Operators with Applications to Friedrichs, Poincaré, Trace, and Similar Constants
    I. Š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.

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.

The illustrated guide to the papers around a paper

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.