Cheeger N-clusters
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 . 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.