2000 character limit reached
Nodal and spectral minimal partitions -- The state of the art in 2015 -- (1506.07249v1)
Published 24 Jun 2015 in math.NA, math.AP, math.OC, and math.SP
Abstract: In this article, we propose a state of the art concerning the nodal and spectral minimal partitions. First we focus on the nodal partitions and give some examples of Courant sharp cases. Then we are interested in minimal spectral partitions. Using the link with the Courant sharp situation, we can determine the minimal k-partitions for some particular domains. We also recall some results about the topology of regular partitions and Aharonov-Bohm approach. The last section deals with the asymptotic behavior of minimal k-partition.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.