<p>Let <i>K</i> be a pure <InlineEquation ID="IEq1"> <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>-dimensional simplicial complex with orientation <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\sigma \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>σ</mi> </math></EquationSource> </InlineEquation>, and <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(s_1\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>s</mi> <mn>1</mn> </msub> </math></EquationSource> </InlineEquation> the <i>i</i>-up Laplacian spectral radius. In this paper, we investigate the upper and lower bounds on <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(s_1\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>s</mi> <mn>1</mn> </msub> </math></EquationSource> </InlineEquation>. On the one hand, we show that <Equation ID="Equ6"> <EquationSource Format="TEX">\(\begin{aligned} s_1\le \max \left\{ d^{+}_{S_{i+1}(K)}(E)+m(E):E\in S_{i}(K)\right\} , \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <msub> <mi>s</mi> <mn>1</mn> </msub> <mo>≤</mo> <mo movablelimits="true">max</mo> <mfenced close="}" open="{"> <msubsup> <mi>d</mi> <mrow> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mrow> <mo>+</mo> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>E</mi> <mo stretchy="false">)</mo> </mrow> <mo>+</mo> <mi>m</mi> <mrow> <mo stretchy="false">(</mo> <mi>E</mi> <mo stretchy="false">)</mo> </mrow> <mo>:</mo> <mi>E</mi> <mo>∈</mo> <msub> <mi>S</mi> <mi>i</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mfenced> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>where <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(d^{+}_{S_{i+1}(K)}(E)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>d</mi> <mrow> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mrow> <mo>+</mo> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>E</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is the upper degree of <i>E</i> and <Equation ID="Equ7"> <EquationSource Format="TEX">\(\begin{aligned} m(E)=\frac{\sum _{E^{\prime }\in S_{i}(K), E^{\prime }\cup E\in S_{i+1}(K) }d^{+}_{S_{i+1}(K)}(E^{\prime }) }{d^{+}_{S_{i+1}(K)}(E)}. \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mi>m</mi> <mrow> <mo stretchy="false">(</mo> <mi>E</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mo>∑</mo> <mrow> <msup> <mi>E</mi> <mo>′</mo> </msup> <mo>∈</mo> <msub> <mi>S</mi> <mi>i</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <msup> <mi>E</mi> <mo>′</mo> </msup> <mo>∪</mo> <mi>E</mi> <mo>∈</mo> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </msub> <msubsup> <mi>d</mi> <mrow> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mrow> <mo>+</mo> </msubsup> <mrow> <mo stretchy="false">(</mo> <msup> <mi>E</mi> <mo>′</mo> </msup> <mo stretchy="false">)</mo> </mrow> </mrow> <mrow> <msubsup> <mi>d</mi> <mrow> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mrow> <mo>+</mo> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>E</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </mfrac> <mo>.</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>Moreover, if <i>K</i> is <InlineEquation ID="IEq6"> <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 equality holds if and only if <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(d^{+}_{S_{i+1}(K)}(E)+m(E)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>d</mi> <mrow> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mrow> <mo>+</mo> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>E</mi> <mo stretchy="false">)</mo> </mrow> <mo>+</mo> <mi>m</mi> <mrow> <mo stretchy="false">(</mo> <mi>E</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is a constant for any <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(E\in S_{i}(K)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>E</mi> <mo>∈</mo> <msub> <mi>S</mi> <mi>i</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, and <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\left( B_{i-1}(K),\sigma \right) \)</EquationSource> <EquationSource Format="MATHML"><math> <mfenced close=")" open="("> <msub> <mi>B</mi> <mrow> <mi>i</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>K</mi> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mi>σ</mi> </mfenced> </math></EquationSource> </InlineEquation> is balanced. This generalizes some bounds on graph Laplacian to higher dimensions. On the other hand, we show that <Equation ID="Equ8"> <EquationSource Format="TEX">\(\begin{aligned} s_1\ge i+2+ \max \left\{ \frac{\sum _{F\in S_{i+1}(K^\prime ) }d^{-}_{S_{i+1}(K^\prime )}(F)}{|S_{i+1}(K^\prime )|}\right\} , \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <msub> <mi>s</mi> <mn>1</mn> </msub> <mo>≥</mo> <mi>i</mi> <mo>+</mo> <mn>2</mn> <mo>+</mo> <mo movablelimits="true">max</mo> <mfenced close="}" open="{"> <mfrac> <mrow> <msub> <mo>∑</mo> <mrow> <mi>F</mi> <mo>∈</mo> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <msup> <mi>K</mi> <mo>′</mo> </msup> <mo stretchy="false">)</mo> </mrow> </mrow> </msub> <msubsup> <mi>d</mi> <mrow> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <msup> <mi>K</mi> <mo>′</mo> </msup> <mo stretchy="false">)</mo> </mrow> </mrow> <mo>-</mo> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>F</mi> <mo stretchy="false">)</mo> </mrow> </mrow> <mrow> <mrow> <mo stretchy="false">|</mo> </mrow> <msub> <mi>S</mi> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <msup> <mi>K</mi> <mo>′</mo> </msup> <mo stretchy="false">)</mo> </mrow> <mrow> <mo stretchy="false">|</mo> </mrow> </mrow> </mfrac> </mfenced> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>where the maximum is taken over all subcomplexes <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(K^{\prime }\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>K</mi> <mo>′</mo> </msup> </math></EquationSource> </InlineEquation> of <i>K</i> such that <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(\left( B_{i}(K^\prime ),\sigma _{K^\prime }\right) \)</EquationSource> <EquationSource Format="MATHML"><math> <mfenced close=")" open="("> <msub> <mi>B</mi> <mi>i</mi> </msub> <mrow> <mo stretchy="false">(</mo> <msup> <mi>K</mi> <mo>′</mo> </msup> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <msub> <mi>σ</mi> <msup> <mi>K</mi> <mo>′</mo> </msup> </msub> </mfenced> </math></EquationSource> </InlineEquation> is balanced. This improves the lower bound given by Duval and Reiner (2002). As a corollary, we also derive a lower bound for <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(s_1\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>s</mi> <mn>1</mn> </msub> </math></EquationSource> </InlineEquation> in terms of the <InlineEquation ID="IEq13"> <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>-diameter <i>d</i> of <i>K</i>, which not only strengthens the previously known bound for graphs (i.e., the case <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(i = 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>), but also generalizes it to higher dimensions.</p>

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

Bounds on the Combinatorial Laplacian Spectral Radius for Simplicial Complexes

  • Yueli Han,
  • Lu Lu,
  • Kun Shi,
  • Jianfeng Wang

摘要

Let K be a pure \((i+1)\) ( i + 1 ) -dimensional simplicial complex with orientation \(\sigma \) σ , and \(s_1\) s 1 the i-up Laplacian spectral radius. In this paper, we investigate the upper and lower bounds on \(s_1\) s 1 . On the one hand, we show that \(\begin{aligned} s_1\le \max \left\{ d^{+}_{S_{i+1}(K)}(E)+m(E):E\in S_{i}(K)\right\} , \end{aligned}\) s 1 max d S i + 1 ( K ) + ( E ) + m ( E ) : E S i ( K ) , where \(d^{+}_{S_{i+1}(K)}(E)\) d S i + 1 ( K ) + ( E ) is the upper degree of E and \(\begin{aligned} m(E)=\frac{\sum _{E^{\prime }\in S_{i}(K), E^{\prime }\cup E\in S_{i+1}(K) }d^{+}_{S_{i+1}(K)}(E^{\prime }) }{d^{+}_{S_{i+1}(K)}(E)}. \end{aligned}\) m ( E ) = E S i ( K ) , E E S i + 1 ( K ) d S i + 1 ( K ) + ( E ) d S i + 1 ( K ) + ( E ) . Moreover, if K is \((i+1)\) ( i + 1 ) -path connected, then equality holds if and only if \(d^{+}_{S_{i+1}(K)}(E)+m(E)\) d S i + 1 ( K ) + ( E ) + m ( E ) is a constant for any \(E\in S_{i}(K)\) E S i ( K ) , and \(\left( B_{i-1}(K),\sigma \right) \) B i - 1 ( K ) , σ is balanced. This generalizes some bounds on graph Laplacian to higher dimensions. On the other hand, we show that \(\begin{aligned} s_1\ge i+2+ \max \left\{ \frac{\sum _{F\in S_{i+1}(K^\prime ) }d^{-}_{S_{i+1}(K^\prime )}(F)}{|S_{i+1}(K^\prime )|}\right\} , \end{aligned}\) s 1 i + 2 + max F S i + 1 ( K ) d S i + 1 ( K ) - ( F ) | S i + 1 ( K ) | , where the maximum is taken over all subcomplexes \(K^{\prime }\) K of K such that \(\left( B_{i}(K^\prime ),\sigma _{K^\prime }\right) \) B i ( K ) , σ K is balanced. This improves the lower bound given by Duval and Reiner (2002). As a corollary, we also derive a lower bound for \(s_1\) s 1 in terms of the \((i+1)\) ( i + 1 ) -diameter d of K, which not only strengthens the previously known bound for graphs (i.e., the case \(i = 0\) i = 0 ), but also generalizes it to higher dimensions.