On the honeycomb conjecture for a class of minimal convex partitions

DOI10.1090/TRAN/7326zbMATH Open1396.52024arXiv1703.05383OpenAlexW2600489988WikidataQ123122735 ScholiaQ123122735MaRDI QIDQ4580354FDOQ4580354

Authors: Dorin Bucur, Ilaria Fragalà, Bozhidar Velichkov, Gianmaria Verzini 

Publication date: 15 August 2018

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Abstract: We prove that the planar hexagonal honeycomb is asymptotically optimal for a large class of optimal partition problems, in which the cells are assumed to be convex, and the criterion is to minimize either the sum or the maximum among the energies of the cells, the cost being a shape functional $F$ which satisfies a few assumptions. They are: monotonicity under inclusions; homogeneity under dilations; a Faber-Krahn inequality for convex hexagons; a convexity-type inequality for the map which associates with every $ninmathbbN$ the minimizers of $F$ among convex $n$-gons with given area. In particular, our result allows to obtain the honeycomb conjecture for the Cheeger constant and for the logarithmic capacity (still assuming the cells to be convex). Moreover we show that, in order to get the conjecture also for the first Dirichlet eigenvalue of the Laplacian, it is sufficient to establish some facts about the behaviour of $lambd{a}_1$ among convex pentagons, hexagons, and heptagons with prescribed area.

Full work available at URL: https://arxiv.org/abs/1703.05383

Recommendations

• A Convex Approach to Minimal Partitions
• Minimum convex partitions of multidimensional polyhedrons
• Minimum Convex Partitions and Maximum Empty Polytopes
• Minimum convex partitions and maximum empty polytopes
• Optimal partitions having disjoint convex and conic hulls
• Minimum \(d\)-convex partition of a multidimensional polyhedron with holes
• On the bounded partition dimension of some classes of convex polytopes
• scientific article; zbMATH DE number 1440643
• On a conjecture of Grünbaum concerning partitions of convex sets
• Convex partitions of a finite lattice

zbMATH Keywords

Cheeger constantoptimal partitionslogarithmic capacityhoneycomb conjecturediscrete Faber-Krahn inequality

Mathematics Subject Classification ID

Optimization of shapes other than minimal surfaces (49Q10) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Inequalities and extremum problems in real or complex geometry (51M16) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Cites Work

• An isoperimetric inequality for logarithmic capacity of polygons
• Characterization of Cheeger sets for convex subsets of the plane
• A Faber-Krahn inequality for the Cheeger constant of \(N\)-gons
• An introduction to the Cheeger problem,
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nodal domains and spectral minimal partitions
• On a class of optimal partition problems related to the Fučík spectrum and to the monotonicity formulae
• An optimal partition problem related to nonlinear eigenvalues.
• Extremality conditions and regularity of solutions to optimal partition problems involving Laplacian eigenvalues
• An optimal partition problem for eigenvalues
• An overview on the Cheeger problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• On spectral minimal partitions: a survey
• Numerical simulations for nodal domains and spectral minimal partitions
• The honeycomb conjecture
• Hexagonal Economic Regions Solve the Location Problem
• Cheeger \(N\)-clusters
• The Brunn-Minkowski inequality for the \(n\)-dimensional logarithmic capacity of convex bodies
• Computing ultra-precise eigenvalues of the Laplacian within polygons
• The Hexagonal Honeycomb Conjecture
• A multiphase shape optimization problem for eigenvalues: qualitative study and numerical results
• A note on the stability of the Cheeger constant of \(N\)-gons

Cited In (17)

• Minimum Convex Partitions and Maximum Empty Polytopes
• Minimum convex partitions of multidimensional polyhedrons
• Proof of the honeycomb asymptotics for optimal Cheeger clusters
• A Convex Approach to Minimal Partitions
• The Cheeger problem in abstract measure spaces
• The Cheeger-N-problem in terms of BV-functions
• Phase field approach to optimal packing problems and related Cheeger clusters
• Optimal partitions for Robin Laplacian eigenvalues
• The honeycomb conjecture
• Dimensional lower bounds for contact surfaces of Cheeger sets
• Optimal partitioning of an interval and applications to Sturm-Liouville eigenvalues
• Large \(m\) asymptotics for minimal partitions of the Dirichlet eigenvalue
• On the honeycomb conjecture for Robin Laplacian eigenvalues
• On the Application of the Honeycomb Conjecture to the Bee's Honeycomb
• Mean-to-max ratio of the torsion function and honeycomb structures
• Asymptotic optimality of the triangular lattice for a class of optimal location problems
• Approximation of partitions of least perimeter by \(\Gamma\)-convergence: around Kelvin's conjecture

This page was built for publication: On the honeycomb conjecture for a class of minimal convex partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580354)