Papers
Topics
Authors
Recent
Search
2000 character limit reached

Componentwise linearity of powers of edge ideals of weighted oriented graphs

Published 18 Sep 2025 in math.AC | (2509.14637v1)

Abstract: In this paper, we study the componentwise linearity of powers of edge ideal of a weighted oriented graph $D$. We give a characterization for componentwise linearity of the edge ideal $I(D)$ in terms of forbidden subgraphs of $D$. If $D$ is house-free or complete $r$-partite, then the following statements are equivalent: (1) $I(D)$ is componentwise linear; (2) $I(D)$ is vertex splittable; (3) $I(D)$ has linear quotient property; (4) both $G$ and $H(I(D)_{(2)})$ are co-chordal and $D_1,D_2,D_3,D_4$ as in Figure 1, are not induced subgraphs of $D$. Furthermore, if $D$ is a complete $r$-partite weighted oriented graph, then we show that: $I(D)k$ is componentwise linear, for some $k\geq 2 \iff I(D)$ is componentwise linear.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.