2019
DOI: 10.1007/s40306-018-00308-z
|View full text |Cite
|
Sign up to set email alerts
|

Depth and Regularity of Monomial Ideals via Polarization and Combinatorial Optimization

Abstract: In this paper we use polarization to study the behavior of the depth and regularity of a monomial ideal I, locally at a variable xi, when we lower the degree of all the highest powers of the variable xi occurring in the minimal generating set of I, and examine the depth and regularity of powers of edge ideals of clutters using combinatorial optimization techniques. If I is the edge ideal of an unmixed clutter with the max-flow min-cut property, we show that the powers of I have non-increasing depth and non-dec… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
5
2
1

Relationship

4
4

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 58 publications
0
5
0
Order By: Relevance
“…The projective dimension, regularity, and algebraic and combinatorial properties of edge ideals of weighted oriented graphs have been studied in [5,8,11,15,21,22]. The first major result about I(D) is an explicit combinatorial expression of Pitones, Reyes and Toledo [15,Theorem 25] for the irredundant decomposition of I(D) as a finite intersection of irreducible monomial ideals.…”
Section: Introductionmentioning
confidence: 99%
“…The projective dimension, regularity, and algebraic and combinatorial properties of edge ideals of weighted oriented graphs have been studied in [5,8,11,15,21,22]. The first major result about I(D) is an explicit combinatorial expression of Pitones, Reyes and Toledo [15,Theorem 25] for the irredundant decomposition of I(D) as a finite intersection of irreducible monomial ideals.…”
Section: Introductionmentioning
confidence: 99%
“…Using a result of [24], we answer a question of Aron Simis and a related question of Antonio Campillo by showing that an oriented graph D is Cohen-Macaulay if and only if the oriented graph U , obtained from D by replacing each weight d i > 3 with d i = 2, is Cohen-Macaulay (Corollary 6). Seemingly, this ought to somewhat facilitate the verification of this property.…”
Section: Introductionmentioning
confidence: 99%
“…This subsumes the class of whiskered graphs treated in [38,Corollary 5.1(2)]. For related work on some more special cases, we refer to [2,3,9,16,26,27,39,42,43].…”
Section: An Application To Edge Idealsmentioning
confidence: 97%