Normality criteria for monomial ideals
Combinatorial aspects of commutative algebra (05E40) Associated graded rings of ideals (Rees ring, form ring), analytic spread and related topics (13A30) Integral closure of commutative rings and ideals (13B22) Theory of modules and ideals in commutative rings described by combinatorial properties (13C70) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)
The work under review is a study of normality of monomial ideals via linear programming and graph theory. Using a normality criterion (Proposition 3.2), in the first main result, the authors give a characterization of the normality of an ideal generated by degree 2 monomials in terms of the Hilbert basis property of the set of vectors \[ \mathcal{B}=\{e_{s+1}\}\cup\{e_i+e_{s+1}:i=1,\dots,s\}\cup\{(v_i,1):i=1,\dots,q\}, \] where \(e_i\) are the members of the canonical basis of \(\mathbb{R}^{s+1}\) and \(v_i\in \mathbb{N}^{s}\) are the exponent of vectors of the monomials of the minimal monomial generating set of \(I\) (Theorem 4.1). The same set comes into play in Theorem 4.4, where a characterization of the equality between the semigroup ring of \(\mathbb{N}\mathcal{B}\) and the Ehrhart ring of \[ \mathcal{Q}=\operatorname{conv}(0,e_1,\dots,e_s,v_1,\dots,v_q)\subset \mathbb{R}^s \] is given in terms the \textit{integer rounding property} of the linear system \(x\geq 0\); \(xA\leq 1\), where \(A\) is the matrix with columns \(v_1,\dots,v_q\). In Section 5 the authors switch the focus to the ideal of covers of a simple graph \(I_c(G)\). In Theorem 5.2, they show that if the neighbor set of a vertex, \(v\), is a minimal vertex cover of \(G\), then \(I_c(G\setminus v)\) is normal if and only if \(I_c(G)\) is. Next they show that if the graph has independence number \(\leq 2\), then \(I_c(G)\) is normal if and only if the edge ideal of the complement graph of \(G\) is normal (Theorem 5.11). Finally, Section 6 contains examples and an appendix contains Normaliz and Macaulay2 procedures to determine the normality of a monomial ideal, the minimal generators of the ideal of covers of a clutter and the Hilbert bases of cones used in the article.
- Normality of cover ideals of graphs and normality under some operations
- Results on the normality of square-free monomial ideals and cover ideals under some graph operations
- Normality of subrings generated by square free monomials
- On the normality of a class of monomial ideals via the Newton polyhedron
- ON THE NORMALITY OF MONOMIAL IDEALS OF MIXED PRODUCTS
- A conjecture on critical graphs and connections to the persistence of associated primes
- Algorithmic graph theory and perfect graphs
- Associated primes of powers of edge ideals
- Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems
- Combinatorial optimization. Packing and covering
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Duality, a-invariants and canonical modules of rings arising from linear optimization problems
- Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals
- Graphs, rings and polyhedra
- scientific article; zbMATH DE number 3902926 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 2173740 (Why is no real title available?)
- scientific article; zbMATH DE number 2084924 (Why is no real title available?)
- scientific article; zbMATH DE number 1860733 (Why is no real title available?)
- scientific article; zbMATH DE number 2236738 (Why is no real title available?)
- Integer Rounding for Polymatroid and Branching Optimization Problems
- Integral closure of ideals, rings, and modules
- Introduction to Toric Varieties. (AM-131)
- Membership criteria and containments of powers of monomial ideals
- Monomial algebras
- Monomial Ideals
- Normality of cover ideals of graphs and normality under some operations
- Normality of subrings generated by square free monomials
- On the ideal theory of graphs
- On total dual integrality
- Polyhedral proof methods in combinatorial optimization
- Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs
- Relative volumes and minors in monomial subrings.
- Replication in critical graphs and the persistence of monomial ideals
- Toric varieties
- Normality of monomial ideals
- Normality of subrings generated by square free monomials
- Normality of cover ideals of graphs and normality under some operations
- On the normality of a class of monomial ideals via the Newton polyhedron
- Normality of monomial ideals in two sets of variables
- Normalization of monomial ideals and Hilbert functions
- Constraints for the normality of monomial subrings and birationality
- Results on the normality of square-free monomial ideals and cover ideals under some graph operations
- Classes of normally and nearly normally torsion-free monomial ideals
- Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals
- Normality and associated primes of closed neighborhood ideals and dominating ideals
This page was built for publication: Normality criteria for monomial ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103343)
