Optimal Hardy Inequality for Fractional Laplacians on the Integers
Matthias Keller, Marius Nietschmann

TL;DR
This paper investigates the fractional Hardy inequality on the integers, establishing the optimal Hardy weight and confirming the sharpness of the inequality's constant.
Contribution
It provides the first proof of the optimal Hardy weight for fractional Laplacians on the integers, demonstrating the inequality's sharpness.
Findings
Proved the optimality of the Hardy weight for fractional Laplacians on integers.
Confirmed the sharpness of the Hardy inequality constant.
Established foundational results for fractional inequalities on discrete domains.
Abstract
We study the fractional Hardy inequality on the integers. We prove the optimality of the Hardy weight and hence affirmatively answer the question of sharpness of the constant.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Harmonic Analysis Research · Nonlinear Partial Differential Equations · Mathematical Approximation and Integration
