arXiv · 2303.07092
Harris' criterion and Hardy inequalites on graphs
Abstract
In this paper we give a version of Harris' criterion for determining $H^{1,p}_0$ within $H^{1,p}$ on discrete spaces. Moreover, we provide a converse via Hardy inequalities involving distances to metric boundaries.
Explore related subjects
Keep this discovery
Simon Murmann, Marcel Schmidt. 2023-03-13. Harris' criterion and Hardy inequalites on graphs. https://arxiv.org/abs/2303.07092
Cite the original work for its findings. Save a collection to share your selection of sources.