Harris' criterion and Hardy inequalites on graphs
Abstract
In this paper we give a version of Harris' criterion for determining H1,p0 within H1,p on discrete spaces. Moreover, we provide a converse via Hardy inequalities involving distances to metric boundaries.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.