On the spectral theory and dispersive estimates for a discrete Schrödinger equation in one dimension
Bibliographic record
Abstract
Based on the recent work [Komech et al., “Dispersive estimates for 1D discrete Schrödinger and Klein-Gordon equations,” Appl. Anal. 85, 1487 (2006)] for compact potentials, we develop the spectral theory for the one-dimensional discrete Schrödinger operator, Hϕ=(−Δ+V)ϕ=−(ϕn+1+ϕn−1−2ϕn)+Vnϕn. We show that under appropriate decay conditions on the general potential (and a nonresonance condition at the spectral edges), the spectrum of H consists of finitely many eigenvalues of finite multiplicities and the essential (absolutely continuous) spectrum, while the resolvent satisfies the limiting absorption principle and the Puiseux expansions near the edges. These properties imply the dispersive estimates ‖eitHPa.c.(H)‖lσ2→l−σ2≲t−3/2 for any fixed σ>52 and any t>0, where Pa.c.(H) denotes the spectral projection to the absolutely continuous spectrum of H. In addition, based on the scattering theory for the discrete Jost solutions and the previous results by Stefanov and Kevrekidis [“Asymptotic behaviour of small solutions for the discrete nonlinear Schrödinger and Klein-Gordon equations,” Nonlinearity 18, 1841 (2005)], we find new dispersive estimates ‖eitHPa.c.(H)‖l1→l∞≲t−1/3, which are sharp for the discrete Schrödinger operators even for V=0.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".