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.
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call