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.

11 pages, to appear in Bulletin des Sciences Mathématiques

References in corpus (4)

• A sharp form of the discrete Hardy inequality and the Keller-Pinchover-Pogorzelski inequality
• Discrete weighted Hardy Inequality in 1-D
• An improved discrete Rellich inequality on the half-line
• Multidimensional Frank-Laptev-Weidl improvement of the Hardy Inequality

Cited by in corpus (1)

• An optimal fractional Hardy inequality on the discrete half-line