Optimal Hardy inequalities for Schr\"odinger operators on graphs
classification
🧮 math.SP
math-phmath.APmath.MP
keywords
lambdaodingerschrgraphsoperatoroperatorsoptimalsubcritical
read the original abstract
For a given subcritical discrete Schr\"odinger operator $H$ on a weighted infinite graph $X$, we construct a Hardy-weight $w$ which is optimal in the following sense. The operator $H - \lambda w$ is subcritical in $X$ for all $\lambda < 1$, null-critical in $X$ for $\lambda = 1$, and supercritical near any neighborhood of infinity in $X$ for any $\lambda > 1$. Our results rely on a criticality theory for Schr\"odinger operators on general weighted graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.