Optimal Hardy inequalities for Schr\"odinger operators on graphs
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 - λ w is subcritical in X for all λ < 1, null-critical in X for λ = 1, and supercritical near any neighborhood of infinity in X for any λ > 1. Our results rely on a criticality theory for Schr\"odinger operators on general weighted graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.