MétaCan
Menu
Back to cohort
Record W1903100294 · doi:10.4310/jdg/1236604347

Counting nodal lines which touch the boundary of an analytic domain

2009· preprint· en· W1903100294 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of Differential Geometry · 2009
Typepreprint
Languageen
FieldMathematics
TopicHolomorphic and Operator Theory
Canadian institutionsMcGill University
Fundersnot available
KeywordsEigenfunctionLambdaBoundary (topology)MathematicsNeumann boundary conditionDomain (mathematical analysis)Mathematical analysisComplex planeUpper and lower boundsBoundary value problemOmegaOrder (exchange)Dirichlet boundary conditionDirichlet distributionCombinatoricsPhysicsEigenvalues and eigenvectorsQuantum mechanics

Abstract

fetched live from OpenAlex

We consider the zeros on the boundary of a Neumann eigenfunction j of a real analytic plane domain . We prove that the number of its boundary zeros is O( j ) where - j = 2 j j . We also prove that the number of boundary critical points of either a Neumann or Dirichlet eigenfunction is O( j ). It follows that the number of nodal lines of j (components of the nodal set) which touch the boundary is of order j . This upper bound is of the same order of magnitude as the length of the total nodal line, but is the square root of the Courant bound on the number of nodal components in the interior. More generally, the results are proved for piecewise analytic domains.

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.

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.002
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.689
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0010.002
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.029
GPT teacher head0.314
Teacher spread0.284 · 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