On the honeycomb conjecture for a class of minimal convex partitions

DOI10.1090/TRAN/7326MaRDI QIDQ4580354zbMATH OpenOpenAlexWikidataFDO

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)

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

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)

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.

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

Cites work

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

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
• Phase field approach to optimal packing problems and related Cheeger clusters
• The Cheeger-N-problem in terms of BV-functions
• Optimal partitions for Robin Laplacian eigenvalues
• The honeycomb conjecture
• Dimensional lower bounds for contact surfaces of Cheeger sets
• Large \(m\) asymptotics for minimal partitions of the Dirichlet eigenvalue
• Optimal partitioning of an interval and applications to Sturm-Liouville eigenvalues
• On the honeycomb conjecture for Robin Laplacian eigenvalues
• Asymptotic optimality of the triangular lattice for a class of optimal location problems
• On the Application of the Honeycomb Conjecture to the Bee's Honeycomb
• Mean-to-max ratio of the torsion function and honeycomb structures
• 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)