20 citations · 45 across the 13 of their papers we have counts for
10 papers · 1 filter
Normality criteria for monomial ideals
Luis A. Dupont, Humberto Muñoz-George, Rafael H. Villarreal
In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials…
On the Stanley depth of edge ideals of k-partite clutters
Luis A. Dupont, Daniel G. Mendoza
We give upper bounds for the Stanley depth of edge ideals of certain k-partite clutters. In particular, we generalize a result of Ishaq about the Stanley depth of the edge ideal of…
The combinatorial calculation of algebraic invariants of a monomial ideal
Luis A. Dupont, Daniel G. Mendoza, Miriam Rodríguez
We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a…
Rees algebras, Monomial Subrings and Linear Optimization Problems
Luis A. Dupont
In this thesis we are interested in studying algebraic properties of monomial algebras, that can be linked to combinatorial structures, such as graphs and clutters, and to optimiza…
Duality, a-invariants and canonical modules of rings arising from linear optimization problems
Joseph P. Brennan, Luis A. Dupont, Rafael H. Villarreal
The aim of this paper is to study integer rounding properties of various systems of linear inequalities to gain insight about the algebraic properties of Rees algebras of monomial…
Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals
Luis A. Dupont, Enrique Reyes-Espinoza, Rafael H. Villarreal
Let C be a uniform clutter and let I=I(C) be its edge ideal. We prove that if C satisfies the packing property (resp. max-flow min-cut property), then there is a uniform Cohen-Maca…