2020
DOI: 10.3233/asy-201642
|View full text |Cite
|
Sign up to set email alerts
|

Courant-sharp Robin eigenvalues for the square: The case of negative Robin parameter

Abstract: We consider the cases where there is equality in Courant’s nodal domain theorem for the Laplacian with a Robin boundary condition on the square. In our previous two papers, we treated the cases where the Robin parameter h > 0 is large, small respectively. In this paper we investigate the case where h < 0.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…A Robin eigenvalue is called Courant‐sharp if it has a corresponding eigenfunction with exactly k$k$ nodal domains; note that an immediate consequence of the Pleijel theorem for C1,1$C^{1,1}$ domains is that the number of Courant‐sharp Robin eigenvlaues is finite. Gittins and Helffer [11, 12] studied upper bounds on the number of Courant‐sharp eigenvalues of the Robin problem on a square when the Robin parameter h$h$ is constant. In particular, they show that the Robin Laplacian on a square with constant parameter h$h$ has finitely many Courant‐sharp eigenvalues.…”
Section: Introductionmentioning
confidence: 99%
“…A Robin eigenvalue is called Courant‐sharp if it has a corresponding eigenfunction with exactly k$k$ nodal domains; note that an immediate consequence of the Pleijel theorem for C1,1$C^{1,1}$ domains is that the number of Courant‐sharp Robin eigenvlaues is finite. Gittins and Helffer [11, 12] studied upper bounds on the number of Courant‐sharp eigenvalues of the Robin problem on a square when the Robin parameter h$h$ is constant. In particular, they show that the Robin Laplacian on a square with constant parameter h$h$ has finitely many Courant‐sharp eigenvalues.…”
Section: Introductionmentioning
confidence: 99%