<p>In this paper we give a version of Harris’ criterion for determining <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="20_2025_2794_Article_IEq1.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="72" Type="Linedraw" Width="33" /> </InlineMediaObject> <EquationSource Format="TEX">\(H^{1,p}_0\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mi>H</mi> <mn>0</mn> <mrow> <mn>1</mn> <mo>,</mo> <mi>p</mi> </mrow> </msubsup> </math></EquationSource> </InlineEquation> within <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="20_2025_2794_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="33" /> </InlineMediaObject> <EquationSource Format="TEX">\(H^{1,p}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>H</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>p</mi> </mrow> </msup> </math></EquationSource> </InlineEquation> on discrete spaces. Moreover, we provide a converse via Hardy inequalities involving distances to metric boundaries.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Harris’ Criterion and Hardy Inequalities on Graphs

  • Simon Murmann,
  • Marcel Schmidt

摘要

In this paper we give a version of Harris’ criterion for determining \(H^{1,p}_0\) H 0 1 , p within \(H^{1,p}\) H 1 , p on discrete spaces. Moreover, we provide a converse via Hardy inequalities involving distances to metric boundaries.