Ratliff Property of Edge Ideals of Weighted Oriented Graphs
Let $D$ be a weighted oriented graph and $I(D)$ be its edge ideal. In this paper, we prove that $I(D)$ satisfies the Ratliff (strong persistence) property in the following three cases: (i) $D$ has an outward leaf; (ii) $D$ has an inward leaf $(u,v)\in E(D)$, where $v$ is a sink vertex; (iii) $D$ has an inward leaf $(u,v)\in E(D)$ with $w(v)=1$. We further show that $(I(D)^2:I(D))=I(D)$ if $D$ contains a vertex with in-degree less than or equal to 1, and $(I(D)^3:I(D))=I(D)^2$ when $D$ is either a weighted oriented cycle, or a tree. Finally, if $D$ contains no source vertex, then any associated prime of $I(D)^k$, other than the irrelevant maximal ideal, is also an associated prime of $I(D)^{k+1}$. In addition, if $D$ contains a vertex of in-degree one and all the vertices of $D$ have non-trivial weights, we show that the persistence property holds.
Authors
- Kanoy Kumar Das (ORCID: https://orcid.org/0000-0002-8969-551X)
- Peter Van Roy (ORCID: https://orcid.org/0000-0002-5427-2445)
- A. Banerjee (ORCID: https://orcid.org/0009-0005-0893-1090)
Institutions
- Indian Institute of Technology Kharagpur (IN)
- Chennai Mathematical Institute (IN)
- Institute of Mathematical Sciences (IN)
Publication Details
- Journal
- The Electronic Journal of Combinatorics
- Published
- 2025-10-03
- DOI
- https://doi.org/10.37236/13223
- Primary Topic
- Commutative Algebra and Its Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Infosys Foundation
- Science and Engineering Research Board