2019
DOI: 10.1016/j.aim.2019.04.036
|View full text |Cite
|
Sign up to set email alerts
|

Proof of the honeycomb asymptotics for optimal Cheeger clusters

Abstract: We prove that, in the limit as k → +∞, 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.2010 Mathematics Subject Classification. 52C20, 51M16, 49Q10.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
9
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(10 citation statements)
references
References 18 publications
1
9
0
Order By: Relevance
“…Theorem 1.1 also allows to obtain a Faber-Krahn-type inequality for the so-called weighted Cheeger constant, and in turn a lower bound for the first eigenvalue for a degenerate elliptic operators. For similar results see also [9,13,14,19,34,44,47].…”
Section: Introductionsupporting
confidence: 57%
“…Theorem 1.1 also allows to obtain a Faber-Krahn-type inequality for the so-called weighted Cheeger constant, and in turn a lower bound for the first eigenvalue for a degenerate elliptic operators. For similar results see also [9,13,14,19,34,44,47].…”
Section: Introductionsupporting
confidence: 57%
“…Theorem 1.1 also allows to obtain a Faber-Krahn -type inequality for the so-called weighted Cheeger constant, and in turn a lower bound for the first eigenvalue for a degenerate elliptic operators. For similar results see also [9], [12], [13], [18], [30], [39], [41]. We define the ratio…”
Section: Introductionmentioning
confidence: 78%
“…One of the main results of this paper is Theorem , where we prove that the kth Cheeger constant hkfalse(normalΩfalse) can be characterized as trueprefixlimp1frakturLkfalse(p;0.16emnormalΩfalse)=hkfalse(normalΩfalse).Let us mention that a related spectral partition problem was studied in . In that paper, the author investigated the limit as p1 of the quantity normalΛk(p)false(normalΩfalse):=inf0truei=1kλ1false(p;0.16emEifalse):EiΩ,false|Eifalse|>0i,EiEj=ijand proved its convergence toward Hkfalse(normalΩfalse):=inf0truei=1kh1false(Eifalse):EiΩ,false|Eifalse|>0i,EiEj=ij.Existence and qualitative properties of minimizing k‐tuples of sets for Hkfalse(normalΩfalse) were also comprehensively studied in …”
Section: Introductionmentioning
confidence: 98%