MétaCan
Menu
Back to cohort
Record W1988395437 · doi:10.4153/cmb-2007-004-3

A Singular Critical Potential for the Schrödinger Operator

2007· article· en· W1988395437 on OpenAlexvenueno aff
Thomas Duyckaerts

Bibliographic record

VenueCanadian Mathematical Bulletin · 2007
Typearticle
Languageen
FieldMathematics
TopicAdvanced Mathematical Physics Problems
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsOperator (biology)Bounded functionOrder (exchange)InfinitySequence (biology)Mathematical analysisSmoothingPolynomialAmplitudeMathematical physicsPure mathematicsCombinatoricsQuantum mechanicsPhysics

Abstract

fetched live from OpenAlex

Abstract Consider a real potential V on Rd, d ≥ 2, and the Schrödinger equation: (LS) i∂tu + Δu −Vu = 0, u↾t=0 = u0 ∈ L2. In this paper, we investigate the minimal local regularity of V needed to get local in time dispersive estimates (such as local in time Strichartz estimates or local smoothing effect with gain of 1/2 derivative) on solutions of (LS). Prior works show some dispersive properties when V (small at infinity) is in Ld/2 or in spaces just a little larger but with a smallness condition on V (or at least on its negative part). In this work, we prove the critical character of these results by constructing a positive potential V which has compact support, bounded outside 0 and of the order (log |x|)2/|x|2 near 0. The lack of dispersiveness comes from the existence of a sequence of quasimodes for the operator P := −Δ + V. The elementary construction of V consists in sticking together concentrated, truncated potential wells near 0. This yields a potential oscillating with infinite speed and amplitude at 0, such that the operator P admits a sequence of quasi-modes of polynomial order whose support concentrates on the pole.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
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.001
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0010.002
Scholarly communication0.0010.001
Open science0.0000.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.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.316
Teacher spread0.287 · 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 source (direct Gemma or distilled Codex), not a consensus.

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

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

Citations22
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueCanadian Mathematical BulletinSame topicAdvanced Mathematical Physics ProblemsFrench-language works237,207