Improvement of the discrete Hardy inequality
arXiv:2209.05288 · doi:10.1016/j.bulsci.2024.103468
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.
arXiv comment11 pages, to appear in Bulletin des Sciences Mathématiques
References in corpus (5)
- A sharp form of the discrete Hardy inequality and the Keller-Pinchover-Pogorzelski inequality
- From Hardy to Rellich inequalities on graphs
- 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