<p>Let <i>K</i> be a simplical complex, and let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1419_Article_IEq1.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="117" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {L}_i^{up}(K), \mathcal {Q}_i^{up}(K)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi mathvariant="script">L</mi> <mi>i</mi> <mrow> <mi mathvariant="italic">up</mi> </mrow> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <msubsup> <mi mathvariant="script">Q</mi> <mi>i</mi> <mrow> <mi mathvariant="italic">up</mi> </mrow> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> be the <i>i</i>-th up Laplacian and signless Laplacian of <i>K</i>, respectively. In this paper, we proved that the largest eigenvalue of <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1419_Article_IEq2.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="54" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {L}_i^{up}(K)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi mathvariant="script">L</mi> <mi>i</mi> <mrow> <mi mathvariant="italic">up</mi> </mrow> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is not greater than the largest eigenvalue of <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1419_Article_IEq3.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="58" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {Q}_i^{up}(K)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi mathvariant="script">Q</mi> <mi>i</mi> <mrow> <mi mathvariant="italic">up</mi> </mrow> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>; furthermore, if <i>K</i> is <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1419_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <EquationSource Format="TEX">\((i+1)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>i</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>-path connected, then the equality holds if and only if the <i>i</i>-th incidence signed graph <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1419_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\(B_i(K)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>B</mi> <mi>i</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> of <i>K</i> is balanced. As an application, we provided an upper bound for the largest eigenvalue of the <i>i</i>-th up Laplacian of <i>K</i>, which improves the bound given by Horak and Jost and generalizes the result of Anderson and Morley on graphs. We characterized the balancedness of the incidence-signed graph of simplicial complexes under operations such as wedge sum, join, Cartesian product and duplication of motifs. For each <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1419_Article_IEq6.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\(i \ge 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>i</mi> <mo>≥</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, by using wedge sum or duplication of motifs, we can construct infinitely many <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1419_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <EquationSource Format="TEX">\((i+1)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>i</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>-path connected simplicial complexes <i>K</i> with <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1419_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\(B_i(K)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>B</mi> <mi>i</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> being balanced.</p>

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

The largest Laplacian eigenvalue and the balancedness of simplicial complexes

  • Yi-Zheng Fan,
  • Hui-Feng Wu,
  • Yi Wang

摘要

Let K be a simplical complex, and let \(\mathcal {L}_i^{up}(K), \mathcal {Q}_i^{up}(K)\) L i up ( K ) , Q i up ( K ) be the i-th up Laplacian and signless Laplacian of K, respectively. In this paper, we proved that the largest eigenvalue of \(\mathcal {L}_i^{up}(K)\) L i up ( K ) is not greater than the largest eigenvalue of \(\mathcal {Q}_i^{up}(K)\) Q i up ( K ) ; furthermore, if K is \((i+1)\) ( i + 1 ) -path connected, then the equality holds if and only if the i-th incidence signed graph \(B_i(K)\) B i ( K ) of K is balanced. As an application, we provided an upper bound for the largest eigenvalue of the i-th up Laplacian of K, which improves the bound given by Horak and Jost and generalizes the result of Anderson and Morley on graphs. We characterized the balancedness of the incidence-signed graph of simplicial complexes under operations such as wedge sum, join, Cartesian product and duplication of motifs. For each \(i \ge 0\) i 0 , by using wedge sum or duplication of motifs, we can construct infinitely many \((i+1)\) ( i + 1 ) -path connected simplicial complexes K with \(B_i(K)\) B i ( K ) being balanced.