Improvement of the discrete Hardy inequality
Abstract
We establish a novel improvement of the classical discrete Hardy inequality, which gives the discrete version of a recent (continuous) inequality of Frank, Laptev, and Weidl. Our arguments build on certain weighted inequalities based on discrete analogues of symmetric decreasing rearrangement techniques.
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.