<p>In this paper, we study the componentwise linearity of edge ideals of weighted oriented graphs. We show that if <i>D</i> is a weighted oriented graph whose edge ideal <i>I</i>(<i>D</i>) is componentwise linear, then the underlying simple graph <i>G</i> of <i>D</i> is co-chordal. We give combinatorial characterizations of componentwise linearity of <i>I</i>(<i>D</i>) if the vertices in <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1401_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="24" /> </InlineMediaObject> <EquationSource Format="TEX">\(V^+\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>V</mi> <mo>+</mo> </msup> </math></EquationSource> </InlineEquation> are sinks or <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1401_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="66" /> </InlineMediaObject> <EquationSource Format="TEX">\(\vert V^+ \vert \le 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mo stretchy="false">|</mo> </mrow> <msup> <mi>V</mi> <mo>+</mo> </msup> <mrow> <mo stretchy="false">|</mo> <mo>≤</mo> <mn>1</mn> </mrow> </mrow> </math></EquationSource> </InlineEquation>. Furthermore, if <i>G</i> belongs to certain chordal graphs or <i>G</i> is bipartite or the vertices in <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1401_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="24" /> </InlineMediaObject> <EquationSource Format="TEX">\(V^+\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>V</mi> <mo>+</mo> </msup> </math></EquationSource> </InlineEquation> are sinks or <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1401_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="66" /> </InlineMediaObject> <EquationSource Format="TEX">\(\vert V^+ \vert \le 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mo stretchy="false">|</mo> </mrow> <msup> <mi>V</mi> <mo>+</mo> </msup> <mrow> <mo stretchy="false">|</mo> <mo>≤</mo> <mn>1</mn> </mrow> </mrow> </math></EquationSource> </InlineEquation>, then we show the following equivalence for <i>I</i>(<i>D</i>): Vertex splittable <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1401_Article_IEq5.gif" Format="GIF" Height="6" Rendition="HTML" Resolution="72" Type="Linedraw" Width="35" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Longleftrightarrow \)</EquationSource> <EquationSource Format="MATHML"><math> <mo stretchy="false">⟺</mo> </math></EquationSource> </InlineEquation> Linear quotient <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1401_Article_IEq5.gif" Format="GIF" Height="6" Rendition="HTML" Resolution="72" Type="Linedraw" Width="35" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Longleftrightarrow \)</EquationSource> <EquationSource Format="MATHML"><math> <mo stretchy="false">⟺</mo> </math></EquationSource> </InlineEquation> Componentwise linear.</p>

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

Componentwise linearity of edge ideals of weighted oriented graphs

  • Manohar Kumar,
  • Ramakrishna Nanduri,
  • Kamalesh Saha

摘要

In this paper, we study the componentwise linearity of edge ideals of weighted oriented graphs. We show that if D is a weighted oriented graph whose edge ideal I(D) is componentwise linear, then the underlying simple graph G of D is co-chordal. We give combinatorial characterizations of componentwise linearity of I(D) if the vertices in \(V^+\) V + are sinks or \(\vert V^+ \vert \le 1\) | V + | 1 . Furthermore, if G belongs to certain chordal graphs or G is bipartite or the vertices in \(V^+\) V + are sinks or \(\vert V^+ \vert \le 1\) | V + | 1 , then we show the following equivalence for I(D): Vertex splittable \(\Longleftrightarrow \) Linear quotient \(\Longleftrightarrow \) Componentwise linear.