In this paper, we introduce techniques for producing normal square-free monomial ideals from old such ideals. These techniques are then used to investigate the normality of cover ideals under some graph operations. Square-free monomial ideals that come out as linear combinations of two normal ideals are shown to be not necessarily normal; under such a case we investigate the integral closedness of all powers of these ideals.
Given the monomial ideal I=(x_1^{α_1},...,x_{n}^{α_{n}})\subset K[x_1,...,x_{n}] where α_{i} are positive integers and K a field and let J be the integral closure of I . It is a challenging problem to translate the question of the normality of J into a question about the exponent set Γ(J) and the Newton polyhedron NP(J). A relaxed version of this problem is to give necessary or sufficient conditions on α_1,...,α_{n} for the normality of J. We show that if α_{i}ε{s,l} with s and l arbitrary positive integers, then J is normal.
Let (P,<) be a finite poset and let G be its comparability graph. If cl(G) is the clutter of maximal cliques of G, we prove that cl(G) satisfies the max-flow min-cut property and that its edge ideal is normally torsion free. We prove that edge ideals of complete admissible uniform clutters are normally torsion free. The normality of a monomial ideal is expressed in terms of blocking polyhedra and the integer decomposition property. For edge ideals of clutters this property completely determine their normality
In this paper we investigate the question of normality for special monomial ideals in a polynomial ring over a field. We first include some expository sections that give the basics on the integral closure of a ideal, the Rees algebra on an ideal, and some fundamental results on the integral closure of a monomial ideal.
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 optimization problems. A goal here is to establish bridges between commutative algebra, combinatorics and optimization. We study the normality and the Gorenstein property-as well as the canonical module and the a-invariant-of Rees algebras and subrings arising from linear optimization problems. In particular, we study algebraic properties of edge ideals and algebras associated to uniform clutters with the max-flow min-cut pr…
Determining whether an arbitrary subring $R$ of $k[x_1^{\pm 1},\dots, x_n^{\pm 1}]$ is a normal domain is, in general, a nontrivial problem, even in the special case of a monomial generated domain. In this paper, we provide a complete characterization of the normality and normalizations of quadratic-monomial generated domains. For a quadratic-monomial generated domain $R$, we develop a combinatorial structure that assigns, to each quadratic monomial of the ring, an edge in a mixed signed, directed graph $G$, i.e., a graph with signed edges and directed edges. We classify the normality and the …
We give a sufficient condition for a monomial ideal to have a nonzero Betti number in each multidegree. In the case of facet ideals of simplicial forests, this condition becomes a necessary one and it allows us to characterize Betti numbers, projective dimension and regularity of such ideals combinatorially. Our condition is expressed in terms of minimal facet covers of simplicial complexes.
Probabilities of random monomial ideals associated to large graphs
University of Hong Kong（香港大学）；Centro de Investigación y de Estudios Avanzados del IPN（墨西哥国立理工学院高级研究中心）；Universidad Nacional Autónoma de México（墨西哥国立自治大学）
We extend the notion of standard pairs to the context of monomial ideals in semigroup rings. Standard pairs can be used as a data structure to encode such monomial ideals, providing an alternative to generating sets that is well suited to computing intersections, decompositions, and multiplicities. We give algorithms to compute standard pairs from generating sets and vice versa and make all of our results effective. We assume that the underlying semigroup ring is positively graded, but not necessarily normal. The lack of normality is at the root of most challenges, subtleties, and innovations …
We introduce and study vertex cover algebras of weighted simplicial complexes. These algebras are special classes of symbolic Rees algebras. We show that symbolic Rees algebras of monomial ideals are finitely generated and that such an algebra is normal and Cohen-Macaulay if the monomial ideal is squarefree. For a simple graph, the vertex cover algebra is generated by elements of degree 2, and it is standard graded if and only if the graph is bipartite. We also give a general upper bound for the maximal degree of the generators of vertex cover algebras.
Well ordered covers of square-free monomial ideals are subsets of the minimal generating set ordered in a certain way that give rise to a Lyubeznik resolution for the ideal, and have guaranteed nonvanishing Betti numbers in certain degrees. This paper is about square-free monomial ideals which have a well ordered cover. We consider the question of subadditivity of syzygies of square-free monomial ideals via complements in the lcm lattice of the ideal, and examine how lattice complementation breaks well ordered covers of the ideal into (well ordered) covers of subideals. We also introduce a fam…
In a recent work, Kaiser, Stehlík and Škrekovski provide a family of critically 3-chromatic graphs whose expansions do not result in critically 4-chromatic graphs, and thus give counterexamples to a conjecture of Francisco, Ha and Van Tuyl. The cover ideal of the smallest member of this family also gives a counterexample to the persistence and non-increasing depth properties. In this paper, we show that the cover ideals of all members of their family of graphs indeed fail to have the persistence and non-increasing depth properties.
In this paper we study irreducible representations and symbolic Rees algebras of monomial ideals. Then we examine edge ideals associated to vertex-weighted 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 algebra using Hilbert bases, and give necessary and sufficient conditions for the equ…
In [MMR], Michałek--Miró-Roig give a beautiful geometric characterization of Artinian quotients by ideals generated by quadratic or cubic monomials, such that the multiplication map by a general linear form fails to be injective in the first nontrivial degree. Their work was motivated by conjectures of Ilardi and Mezzetti-Miró-Roig-Ottaviani, connecting the failure to Laplace equations and classical results of Togliatti on osculating planes. We study quotients by quadratic monomial ideals, explaining failure of the Weak Lefschetz Property for some cases not covered by [MMR].
In this paper, our main focus is to explore different classes of nearly normally torsion-free ideals. We first characterize all finite simple connected graphs with nearly normally torsion-free cover ideals. Next, we characterize all normally torsion-free $t$-spread principal Borel ideals that can also be viewed as edge ideals of uniform multipartite hypergraphs.
We classify all unmixed monomial ideals I of codimension 2 which are generically a complete intersection and which have the property that the symbolic power algebra A(I) is standard graded. We give a lower bound for the highest degree of a generator of A(I) in the case that I is a modification of the vertex cover ideal of a bipartite graph, and show that this highest degree can be any given number. We furthermore give an upper bound for the highest degree of a generator of the integral closure of A(I) in the case that I is a monomial ideal which is generically a complete intersection.
We give a new combinatorial characterization of the big height of a squarefree monomial ideal leading to a new bound for the projective dimension of a monomial ideal.
In this short note we prove that the projective dimension of a sequentially Cohen-Macaulay square-free monomial ideal is equal to the maximal height of its minimal primes (also known as the big height), or equivalently, the maximal cardinality of a minimal vertex cover of its facet complex. This in particular gives a formula for the projective dimension of facet ideals of these classes of ideals, which are known to be sequentially Cohen-Macaulay: graph trees and simplicial trees, chordal graphs and some cycles, chordal clutters and graphs, and some path ideals to mention a few. Since polarizat…
Given a set of forms f={f_1,...,f_m} in R=k[x_1,...,x_n], where k is a field of characteristic zero, we focus on the first syzygy module Z of the transposed Jacobian module D(f), whose elements are called differential syzygies of f. There is a distinct submodule P of Z coming from the polynomial relations of f through its transposed Jacobian matrix, the elements of which are called polar syzygies of f. We say that f is polarizable if equality P=Z holds. This paper is concerned with the situation where f are monomials of degree 2, in which case one can naturally associate to them a graph G(f) w…
Let $I$ be a square-free monomial ideal in $R = k[x_1,\ldots,x_n]$, and consider the sets of associated primes ${\rm Ass}(I^s)$ for all integers $s \geq 1$. Although it is known that the sets of associated primes of powers of $I$ eventually stabilize, there are few results about the power at which this stabilization occurs (known as the index of stability). We introduce a family of square-free monomial ideals that can be associated to a finite simple graph $G$ that generalizes the cover ideal construction. When $G$ is a tree, we explicitly determine ${\rm Ass}(I^s)$ for all $s \geq 1$. As cons…
An equigenerated monomial ideal $I$ in the polynomial ring $R=k[z_1,\ldots, z_n]$ is a Freiman ideal if $μ(I^2)=\ell(I)μ(I)-{\ell(I)\choose 2}$ where $\ell(I)$ is the analytic spread of $I$ and $μ(I)$ is the number of minimal generators of $I$. In this paper we classify all simple connected unmixed bipartite graphs whose cover ideals are Freiman ideals.
There is a natural one-to-one correspondence between squarefree monomial ideals and finite simple hypergraphs via the cover ideal construction. Let H be a finite simple hypergraph, and let J = J(H) be its cover ideal in a polynomial ring R. We give an explicit description of all associated primes of R/J^s, for any power J^s of J, in terms of the coloring properties of hypergraphs arising from H. We also give an algebraic method for determining the chromatic number of H, proving that it is equivalent to a monomial ideal membership problem involving powers of J. Our work yields two new purely al…
The aim of this paper is to study the associated primes of powers of squarefree monomial ideals. Hypergraphs and squarefree monomial ideals are strongly connected. The cover ideal $J(H)$ of a hypergraph $H$ is the intersection of the primes corresponding to the edges of $H$. We define the $shadow$ of $H$ as a certain set of smaller hypergraphs related to $H$. We then describe how the shadows of $H$ preserve information about the associated primes of the powers of $J(H)$. Some implications to the persistence property are studied.
We present a close relationship between matching number, covering numbers and their fractional versions in combinatorial optimization and ordinary powers, integral closures of powers, and symbolic powers of monomial ideals. This relationship leads to several new results and problems on the containments between these powers.
We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications, we show that edge ideals of graphs are splittable, and we provide an iterative method for computing the Betti numbers of the cover ideals of Cohen-Macaulay bipartite graphs. Finally, we consider the frequency with which one can find particular splittings of monomial ideals and raise questions about ideals whose resolutions are characteristic-dependent.
For the edge ideal I of an arbitrary simple graph G we describe the monomials of the saturation of a power of I in terms of (vertex) weighted graphs associated with the monomials. This description allows us to characterize the embedded associated primes of a power of I as covers of G which contain certain types of subgraphs of G. As an application, we completely classify the associated primes of the second and the third power of I in terms of G.
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 grap…
A quasi-equigenerated monomial ideal $I$ in the polynomial ring $R= k[x_1, \ldots, x_n]$ is a Freiman ideal if $μ(I^2) = l(I)μ(I)- \binom{l(I)}{2}$ where $l(I)$ is the analytic spread of $I$ and $μ(I)$ is the number of minimal generators of $I$. Freiman ideals are special since there exists an exact formula computing the minimal number of generators of any of their powers. In this work we address the question of characterizing which cover ideals of simple graphs are Freiman.
Let $S={\sf k}[X_1,\dots, X_n]$ be a polynomial ring, where ${\sf k}$ is a field. This article deals with the defining ideal of the Rees algebra of squarefree monomial ideal generated in degree $n-2$. As a consequence, we prove that Betti numbers of powers of the cover ideal of the complement graph of a tree do not depend on the choice of tree. Further, we study the regularity and Betti numbers of powers of cover ideals associated to certain graphs.
We compute the reduced Gröbner basis of the toric ideal with respect to a suitable monomial order and we study the Hilbert series of the vertex cover algebra $A(G)$, where $G$ is an unmixed bipartite graph without isolated vertices.
The toric fiber product is a general procedure for gluing two ideals, homogeneous with respect to the same multigrading, to produce a new homogeneous ideal. Toric fiber products generalize familiar constructions in commutative algebra like adding monomial ideals and the Segre product. We describe how to obtain generating sets of toric fiber products in non-zero codimension and discuss persistence of normality and primary decompositions under toric fiber products. Several applications are discussed, including (a) the construction of Markov bases of hierarchical models in many new cases, (b) a n…
Let $I$ be an ideal whose symbolic Rees algebra is Noetherian. For $m \geq 1$, the $m$-th symbolic defect, sdefect$(I,m)$, of $I$ is defined to be the minimal number of generators of the module $\frac{I^{(m)}}{I^m}$. We prove that sdefect$(I,m)$ is eventually quasi-polynomial as a function in $m$. We compute the symbolic defect explicitly for certain monomial ideals arising from graphs, termed cover ideals. We go on to give a formula for the Waldschmidt constant, an asymptotic invariant measuring the growth of the degrees of generators of symbolic powers, for ideals whose symbolic Rees algebra…
Symbolic powers are studied in the combinatorial context of monomial ideals. When the ideals are generated by quadratic squarefree monomials, the generators of the symbolic powers are obstructions to vertex covering in the associated graph and its blowups. As a result, perfect graphs play an important role in the theory, dual to the role played by perfect graphs in the theory of secants of monomial ideals. We use Gröbner degenerations as a tool to reduce questions about symbolic powers of arbitrary ideals to the monomial case. Among the applications are a new, unified approach to the Gröbner b…
We extend the sortability concept to monomial ideals which are not necessarily generated in one degree and as an application we obtain normal Cohen-Macaulay toric rings attached to vertex cover ideals of graphs. Moreover, we consider a construction on a graph called a clique multi-whiskering which always produces vertex cover ideals with componentwise linear powers.
Let $G=(V,E)$ be a connected simple graph, with $n$ vertices such that $S$ is its homogeneous monomial subring. We prove that if $S$ is normal and Gorenstein, then $G$ is unmixed with cover number $\lceil\frac{n}{2}\rceil$ and $G$ has a strong $\lceil\frac{n}{2}\rceil$-$τ$-reduction. Furthermore, if $n$ is even, then we show that $G$ is bipartite. Finally, if $S$ is normal and $G$ is unmixed whose cover number is $\lceil\frac{n}{2}\rceil$, we give sufficient conditions for $S$ to be Gorenstein.
Let $J\subset S=K[x_0,...,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of the homogeneous polynomial ideals $I$, such that the monomials outside $J$ form a $K$-vector basis of $S/I$, is called a {\em $J$-marked family}. It can be endowed with a structure of affine scheme, called a {\em $J$-marked scheme}. For special ideals $J$, $J$-marked schemes provide an open cover of the Hilbert scheme $\hilbp$, where $p(t)$ is the Hilbert polynomial of $S/J$. Those ideals more suitable to this aim are the $m$-truncation ideals $\underline{J}_{\geq m}$ generated by the monomials of d…
Let $\mathbb{K}$ be a field and $R = \mathbb{K}[x_1, \ldots, x_n]$. We obtain an improved upper bound for asymptotic resurgence of squarefree monomial ideals in $R$. We study the effect on the resurgence when sum, product and intersection of ideals are taken. We obtain sharp upper and lower bounds for the resurgence and asymptotic resurgence of cover ideals of finite simple graphs in terms of associated combinatorial invariants. We also explicitly compute the resurgence and asymptotic resurgence of cover ideals of several classes of graphs. We characterize a graph being bipartite in terms of t…
Given an arbitrary graph G, we study its basic covers algebra, which is the symbolic fiber cone of the Alexander dual of the edge ideal of G. Extending results of Villarreal and Benedetti-Constantinescu-Varbaro, valid only in the case when G is bipartite, we characterize in a combinatorial fashion the situations when: 1) the basic covers algebra is a domain, and 2) it is a domain and in addition (the edge ideal of) G is unmixed. It turns out that the last result gives a complete characterization of those graphs for which any symbolic power of the edge ideal is generated by monomials of the sam…
The algebra of basic covers of a graph G, denoted by \A(G), was introduced by Juergen Herzog as a suitable quotient of the vertex cover algebra. In this paper we show that if the graph is bipartite then \A(G) is a homogeneous algebra with straightening laws and thus is Koszul. Furthermore, we compute the Krull dimension of \A(G) in terms of the combinatorics of G. As a consequence we get new upper bounds on the arithmetical rank of monomial ideals of pure codimension 2. Finally, we characterize the Cohen-Macaulay property and the Castelnuovo-Mumford regularity of the edge ideal of a certain cl…
We introduce a conjecture about constructing critically (s+1)-chromatic graphs from critically s-chromatic graphs. We then show how this conjecture implies that any unmixed height two square-free monomial ideal I, i.e., the cover ideal of a finite simple graph, has the persistence property, that is, Ass(R/I^s) \subseteq Ass(R/I^{s+1}) for all s >= 1. To support our conjecture, we prove that the statement is true if we also assume that χ_f(G), the fractional chromatic number of the graph G, satisfies χ(G) -1 < χ_f(G) <= χ(G). We give an algebraic proof of this result.
