Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 75 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 104 tok/s Pro
Kimi K2 170 tok/s Pro
GPT OSS 120B 468 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Pleijel's nodal domain theorem for Neumann and Robin eigenfunctions (1609.02331v2)

Published 8 Sep 2016 in math.AP and math.SP

Abstract: In this paper, we show that equality in Courant's nodal domain theorem can only be reached for a finite number of eigenvalues of the Neumann Laplacian, in the case of an open, bounded and connected set in R n with a C 1,1 boundary. This result is analogous to Pleijel's nodal domain theorem for the Dirichlet Laplacian (1956). It confirms, in all dimensions, a conjecture formulated by Pleijel, which had already been solved by I. Polterovich for a two-dimensional domain with a piecewise-analytic boundary (2009). We also show that the argument and the result extend to a class of Robin boundary conditions.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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