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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Ratliff Property of Edge Ideals of Weighted Oriented Graphs

Kanoy Kumar Das, Peter Van Roy, A. Banerjee
The Electronic Journal of Combinatorics
Commutative Algebra and Its Applications
article

Ratliff Property of Edge Ideals of Weighted Oriented Graphs

Kanoy Kumar Das, Peter Van Roy, A. Banerjee
article en

Abstract

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.

The Electronic Journal of CombinatoricsVol. 32(4)
Indian Institute of Technology Kharagpur (IN), Chennai Mathematical Institute (IN), Institute of Mathematical Sciences (IN)
Infosys Foundation, Science and Engineering Research Board
Openalex Percentile: Top 65%
Commutative Algebra and Its Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.