For a bounded planar domain and an integer , partition into disjoint subdomains so as to minimize the sum of the first Dirichlet eigenvalues of the cells. Caffarelli and Lin (2007) conjectured that as the optimal partitions converge, away from the boundary, to the regular hexagonal honeycomb — most cells becoming asymptotically congruent regular hexagons of equal area, with deviations confined to a boundary layer of order cells — so that the normalized minimal energy satisfies , where is the unit-area regular hexagon. Geng and Lin (2022) proved that this limit exists as a shape-independent constant ; identifying with and proving the geometric hexagonal convergence remain open. This is the spectral analogue of Hales's honeycomb theorem for perimeter and is proved only for Cheeger and Robin analogues or under convexity and periodicity restrictions.
Background
Let be a bounded Lipschitz domain. For a measurable set , denotes the first eigenvalue of the Dirichlet Laplacian on (the Laplacian with zero boundary condition on ); it scales as . The optimal partition problem of Caffarelli and Lin asks for a partition of into mutually disjoint subdomains minimizing
They proved that (relaxed) minimizers exist as classical solutions, that the interfaces between cells are smooth outside a singular set of Hausdorff dimension at most , and the asymptotic comparability with the -th Dirichlet eigenvalue of .
The Faber–Krahn inequality states that among sets of given area the disk minimizes ; hence every cell satisfies for the unit-area disk , which yields the first-order lower bound on the normalized energy . Equality would force every cell to be a disk, which is impossible since disks do not tile the plane, so the question is which cell shapes an optimal packing actually uses. For the perimeter functional this is exactly Hales's honeycomb theorem: the regular hexagonal tiling minimizes total perimeter among unit-area partitions of the plane. For the spectral functional, Caffarelli and Lin conjectured the analogous statement: as the optimal partition of a planar domain approaches the regular hexagonal honeycomb, most cells becoming asymptotically congruent regular hexagons of area , except in a boundary layer of order cells near . Numerical evidence has consistently supported this picture since the Fleming–Viot particle simulations of Burdzy, Hołyst, Ingerman and March on the disk (1996) and the dedicated computations of Bourdin, Bucur and Oudet, which show hexagonal interior patterns with roughly pentagonal cells hugging the boundary. Writing for the unit-area regular hexagon, the sharp form of the conjecture is
together with local geometric convergence of the minimizers to the hexagonal tiling.
Geng and Lin proved that the limit exists and equals a shape-independent constant for every bounded smooth domain, with ; Bourgain and Steinerberger, via a quantitative Faber–Krahn inequality combined with packing properties of disks in the plane, improved the lower bound to for some , so the Faber–Krahn (disk) constant is not attained. For related functionals the honeycomb asymptotics is proved: for the Cheeger constant (for the criterion of minimizing the largest Cheeger constant among the cells) and for the first eigenvalue of the Laplacian under Robin boundary conditions ( on the boundary, with fixed boundary parameter ), Bucur and Fragalà established the honeycomb asymptotics without constraints. For itself, the conjecture is proved only under an a priori convexity assumption on the cells (Bucur–Fragalà–Velichkov–Verzini, conditionally on open facts about among convex pentagons, hexagons and heptagons of fixed area) and, more recently, among convex periodic tessellations of the plane (Cesaroni–Fragalà–Novaga, using that decreases under Steiner symmetrization, the rearrangement of a set that makes it symmetric about a line while preserving area). The unconstrained, non-periodic problem for the first Dirichlet eigenvalue — the original Caffarelli–Lin conjecture — remains open.
Problem Statement
Let be a bounded Lipschitz domain and let over all partitions into disjoint subdomains, where is the first Dirichlet eigenvalue. It is known (Geng–Lin) that the limit
exists and is independent of , and that for the unit-area disk , the unit-area regular hexagon and some . Prove or refute the Caffarelli–Lin hexagonal packing conjecture, whose two components jointly state that the large- optimal partitions are asymptotically the regular hexagonal honeycomb:
(i) (sharp constant) : the regular hexagonal tiling is asymptotically optimal for the sum of first Dirichlet eigenvalues among all partitions — with no convexity, polygonality or periodicity restriction on the cells;
(ii) (limiting geometry) for every sequence of optimal -partitions with (up to extraction of subsequences), all but cells are, up to translation and scaling to common area, asymptotically congruent to the regular hexagon, the exceptional cells being concentrated near in a boundary layer expected to contain on the order of cells.
A refutation may consist of a rigorous construction of admissible partitions of a bounded planar domain whose normalized energy is asymptotically strictly below (contradicting (i), and thereby (ii)), or a proof that optimal partitions fail to converge locally to the hexagonal honeycomb. Both parts together constitute the source question; part (i) alone is the sharp asymptotic constant identification.
References
- L. A. Caffarelli and F. H. Lin, An Optimal Partition Problem for Eigenvalues, Journal of Scientific Computing 31(1–2), 5–18 (2007). DOI: 10.1007/s10915-006-9114-8. https://doi.org/10.1007/s10915-006-9114-8
- Z. Geng and F. Lin, Large asymptotics for minimal partitions of the Dirichlet eigenvalue, Science China Mathematics 65, 1–8 (2022). DOI: 10.1007/s11425-020-1802-6. arXiv:2005.10972. https://arxiv.org/abs/2005.10972
- D. Bucur and I. Fragalà, Proof of the honeycomb asymptotics for optimal Cheeger clusters, Advances in Mathematics 350, 97–129 (2019). DOI: 10.1016/j.aim.2019.04.036. arXiv:1707.00605. https://arxiv.org/abs/1707.00605
- D. Bucur, I. Fragalà, B. Velichkov and G. Verzini, On the honeycomb conjecture for a class of minimal convex partitions, Transactions of the American Mathematical Society 370(10), 7149–7179 (2018). DOI: 10.1090/tran/7326. arXiv:1703.05383. https://arxiv.org/abs/1703.05383
- V. Bonnaillie-Noël and B. Helffer, Nodal and spectral minimal partitions — The state of the art in 2015, arXiv:1506.07249 (2015). https://arxiv.org/abs/1506.07249
- B. Bourdin, D. Bucur and É. Oudet, Optimal Partitions for Eigenvalues, SIAM Journal on Scientific Computing 31(6), 4100–4114 (2010). DOI: 10.1137/090747087. https://doi.org/10.1137/090747087
- A. Cesaroni, I. Fragalà and M. Novaga, A note on the honeycomb optimality among periodic convex tilings, arXiv:2507.01566 (2025). https://arxiv.org/abs/2507.01566
- T. C. Hales, The Honeycomb Conjecture, Discrete & Computational Geometry 25(1), 1–22 (2001). DOI: 10.1007/s004540010071. https://doi.org/10.1007/s004540010071
- J. Bourgain, On Pleijel's Nodal Domain Theorem, International Mathematics Research Notices 2015(6), 1601–1612 (2015). DOI: 10.1093/imrn/rnt241. https://doi.org/10.1093/imrn/rnt241
- S. Steinerberger, A Geometric Uncertainty Principle with an Application to Pleijel's Estimate, Annales Henri Poincaré 15(12), 2299–2319 (2014). DOI: 10.1007/s00023-013-0310-4. https://doi.org/10.1007/s00023-013-0310-4
- K. Burdzy, R. Hołyst, D. Ingerman and P. March, Configurational transition in a Fleming–Viot-type model and probabilistic interpretation of Laplacian eigenfunctions, Journal of Physics A: Mathematical and General 29(11), 2633–2642 (1996). DOI: 10.1088/0305-4470/29/11/004. https://doi.org/10.1088/0305-4470/29/11/004
- R. Ognibene and B. Velichkov, A survey on the optimal partition problem, La Matematica 5 (2026); arXiv:2510.08241 (2025). DOI: 10.1007/s44007-025-00176-8. https://arxiv.org/abs/2510.08241