Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cheeger $N$-clusters

Published 23 Jan 2015 in math.AP and math.OC | (1501.05923v3)

Abstract: In this paper we introduce a Cheeger-type constant defined as a minimization of a suitable functional among all the $N$-clusters contained in an open bounded set $\Omega$. Here with $N$-Cluster we mean a family of $N$ sets of finite perimeter, disjoint up to a set of null Lebesgue measure. We call any $N$-cluster attaining such a minimum a Cheeger $N$-cluster. Our purpose is to provide a non trivial lower bound on the optimal partition problem for the first Dirichlet eigenvalue of the Laplacian. Here we discuss the regularity of Cheeger $N$-clusters in a general ambient space dimension and we give a precise description of their structure in the the planar case. The last part is devoted to the relation between the functional introduced here (namely the $N$-Cheeger constant), the partition problem for the first Dirichlet eigenvalue of the Laplacian and the Caffarelli and Lin's conjecture.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.