Acta Mathematica Vietnamica
- Volume 49
- Volume 48
- Volume 47
- Volume 46
- Volume 45
- Volume 44
- Volume 43
- Volume 42
- Volume 41
- Volume 40
- Volume 39
- Volume 38
- Volume 37
- Volume 36
- Volume 35
- Volume 34
- Volume 33
- Volume 32
- Volume 31
- Volume 30
- Volume 29
- Volume 28
- Volume 27
- Volume 26
- Volume 25
- Volume 24
- Volume 23
- Volume 22
- Volume 21
- Volume 20
- Volume 19
- Volume 18
- Volume 17
- Volume 16
- Volume 15
- Volume 14
- Volume 13
- Volume 12
- Volume 11
- Volume 10
- Volume 9
- Volume 8
- Volume 7
- Volume 6
- Volume 5
- Volume 4
- Volume 3
- Volume 2
- Volume 1
Depth and Regularity of Monomial Ideals via Polarization and Combinatorial Optimization
José Martínez-Bernal
,
Susan Morey
,
Rafael H. Villarreal
,
Carlos E. Vivares
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 $x_i$, when we lower the degree of all the highest powers of the variable $x_i$ 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-decreasing regularity. In particular, edge ideals of unmixed bipartite graphs have non-decreasing regularity. We are able to show that the symbolic powers of the ideal of covers of the clique clutter of a strongly perfect graph have non-increasing depth. A similar result holds for the ideal of covers of a uniform ideal clutter.