arXiv · 1707.00605
Proof of the Honeycomb Asymptotics for Optimal Cheeger Clusters
Abstract
We prove that, in the limit as $k \to+ \infty$, the hexagonal honeycomb solves the optimal partition problem in which the criterion is minimizing the largest among the Cheeger constants of $k$ mutually disjoint cells in a planar domain. As a by-product, the same result holds true when the Cheeger constant is replaced by the first Robin eigenvalue of the Laplacian.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Dorin Bucur, Ilaria Fragala. 2017-06-30. Proof of the Honeycomb Asymptotics for Optimal Cheeger Clusters. https://arxiv.org/abs/1707.00605
Cite the original work for its findings. Save a collection to share your selection of sources.