On weighted $L^p$-Hardy inequality on domains in $\mathbb{R}^n$
Divya Goel, Yehuda Pinchover, and Georgios Psaradakis

TL;DR
This paper provides an alternative proof of a weighted $L^p$-Hardy inequality involving the distance to the boundary in domains of Euclidean space, establishing sharp constants using criticality theory.
Contribution
It offers a new proof of an existing Hardy inequality with sharp constants for arbitrary domains in $\,\mathbb{R}^n$ using criticality theory.
Findings
Proved the weighted Hardy inequality with sharp constant.
Extended the inequality to arbitrary domains in Euclidean space.
Used criticality theory as a novel proof technique.
Abstract
We consider weighted -Hardy inequalities involving the distance to the boundary of a domain in the -dimensional Euclidean space with nonempty boundary. Using criticality theory, we give an alternative proof of the following result of F.~G.~Avkhadiev (2006) Theorem: Let , , be an arbitrary domain, and . Let denote the distance of a point to . Then the following Hardy-type inequality holds and the lower bound constant is sharp.
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
TopicsNonlinear Partial Differential Equations · Advanced Harmonic Analysis Research · Advanced Mathematical Modeling in Engineering
