One dimensional sharp discrete Hardy-Rellich inequalities
Abstract
In this paper, we establish discrete Hardy-Rellich inequalities on N with 2 and optimal constants, for any ≥ 1. As far as we are aware, these sharp inequalities are new for ≥ 3. Our approach is to use weighted equalities to get some sharp Hardy inequalities using shifting weights, then to settle the higher order cases by iteration. We provide also a new Hardy-Leray type inequality on N with the same constant as the continuous setting. Furthermore, the main ideas work also for general graphs or the p setting.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.