2017
DOI: 10.1007/s00526-017-1198-5
|View full text |Cite
|
Sign up to set email alerts
|

A minimal partition problem with trace constraint in the Grushin plane

Abstract: We study a variational problem for the perimeter associated with the Grushin plane, called minimal partition problem with trace constraint. This consists in studying how to enclose three prescribed areas in the Grushin plane, using the least amount of perimeter, under an additional "one-dimensional" constraint on the intersections of their boundaries. We prove existence of regular solutions for this problem, and we characterize them in terms of isoperimetric sets, showing differences with the Euclidean case. T… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
5
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 28 publications
1
5
0
Order By: Relevance
“…We emphasize that our main result generalizes the isoperimetric inequality in the Grushin plane proved in [40] (see also [28][29][30]) which corresponds to Theorem 1.1 with α = 0 and β ∈ (−1, 0] (see Rem. 2.15 in Sect.…”
Section: Introductionsupporting
confidence: 66%
See 2 more Smart Citations
“…We emphasize that our main result generalizes the isoperimetric inequality in the Grushin plane proved in [40] (see also [28][29][30]) which corresponds to Theorem 1.1 with α = 0 and β ∈ (−1, 0] (see Rem. 2.15 in Sect.…”
Section: Introductionsupporting
confidence: 66%
“…Remark 2.15. In [40] (see also [28][29][30]) the authors obtain a sharp isoperimetric inequality in the Grushin plane, and they also compute the corresponding isoperimetric sets. Their proof consists of three steps.…”
Section: )mentioning
confidence: 99%
See 1 more Smart Citation
“…as k → +∞. Arguing as in the proof of [11,Lemma 2.1], one can prove that ( Ẽk ) k∈N ⊂ S x ∩ S * y . Now let us set E k = Ẽk ∩ H + for each k ∈ N. Since P ( Ẽ) = 2P (E; H + ) and P ( Ẽk ) = 2P (E k ; H + ) by symmetry, from (3.5) we deduce that…”
mentioning
confidence: 84%
“…In [22], the authors characterize isoperimetric sets in this framework. We also refer to [13] for a multidimensional generalization of the isoperimetric problem, and to [12,16] for a first approach to clustering problems in the Grushin plane. Note that in these references the Grushin perimeter is defined in a more general way via De Giorgi's definition allowing for non-Euclidean rectifiable sets.…”
Section: Examplesmentioning
confidence: 99%