MétaCan
Menu
Back to cohort
Record W4407755541 · doi:10.1007/s00023-024-01536-w

Pleijel’s Theorem for Schrödinger Operators

2025· article· en· W4407755541 on OpenAlexfundno aff
Philippe Charron, Corentin Léna

Bibliographic record

VenueAnnales Henri Poincaré · 2025
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Mathematical Modeling in Engineering
Canadian institutionsnot available
FundersUniversité de MontréalEuropean Cooperation in Science and Technology
KeywordsSchrödinger's catMathematicsMathematical economicsMathematical physics

Abstract

fetched live from OpenAlex

Abstract We are concerned in this paper with the real eigenfunctions of Schrödinger operators. We prove an asymptotic upper bound for the number of their nodal domains, which implies in particular that the inequality stated in Courant’s theorem is strict, except for finitely many eigenvalues. Results of this type originated in 1956 with Pleijel’s theorem on the Dirichlet Laplacian and were obtained for some classes of Schrödinger operators by the first author, alone and in collaboration with B. Helffer and T. Hoffmann-Ostenhof. Using methods in part inspired by work of the second author on Neumann and Robin Laplacians, we greatly extend the scope of these previous results.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.687
Threshold uncertainty score0.572

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.018
GPT teacher head0.282
Teacher spread0.264 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueAnnales Henri PoincaréSame topicAdvanced Mathematical Modeling in EngineeringFrench-language works237,207