Singularities, Algebraic Geometry, Commutative Algebra, and Related Topics 2018
DOI: 10.1007/978-3-319-96827-8_21
|View full text |Cite
|
Sign up to set email alerts
|

Symbolic Powers of Monomial Ideals and Cohen-Macaulay Vertex-Weighted Digraphs

Abstract: In this paper we study irreducible representations and symbolic Rees algebras of monomial ideals. Then we examine edge ideals associated to vertexweighted oriented graphs. These are digraphs having no oriented cycles of length two with weights on the vertices. For a monomial ideal with no embedded primes we classify the normality of its symbolic Rees algebra in terms of its primary components. If the primary components of a monomial ideal are normal, we present a simple procedure to compute its symbolic Rees a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
18
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 23 publications
(19 citation statements)
references
References 34 publications
1
18
0
Order By: Relevance
“…It was shown in [23] that the vanishing ideals of these projective spaces can be generated by a set of binomials that form a Gröbner basis whose resulting initial ideal is precisely the edge ideal of a weighted oriented graph. The Cohen-Macaulay property of these ideals was studied in [10,13]. Using our techniques we can construct initially regular sequences that bound the depths of the edge ideals of general weighted oriented graphs.…”
Section: 1mentioning
confidence: 99%
“…It was shown in [23] that the vanishing ideals of these projective spaces can be generated by a set of binomials that form a Gröbner basis whose resulting initial ideal is precisely the edge ideal of a weighted oriented graph. The Cohen-Macaulay property of these ideals was studied in [10,13]. Using our techniques we can construct initially regular sequences that bound the depths of the edge ideals of general weighted oriented graphs.…”
Section: 1mentioning
confidence: 99%
“…Since the underlying graph G of D is simple, it has not isolated vertex. Thus t 1 = t 2 and I(D) = (x 21 x w 11 11 , x 22 x w 12 12 , . .…”
Section: Projective Dimension and Regularity Of Edge Ideals Of The Sementioning
confidence: 99%
“…The edge ideal of a vertex-weighted digraph was first introduced by Gimenez et al [11]. Let D = (V, E, w) be a vertex-weighted digraph with the vertex set V = {x 1 , .…”
Section: Introductionmentioning
confidence: 99%
“…. , t s ] over a ground field K. The edge ideal of D, introduced in [5,18], is the ideal of S given by I(D) := (t i t w j j | (t i , t j ) ∈ E(D)).…”
Section: Introductionmentioning
confidence: 99%