Let I=(x^{v_1},...,x^{v_q} be a square-free monomial ideal of a polynomial ring K[x_1,...,x_n] over an arbitrary field K and let A be the incidence matrix with column vectors {v_1},...,{v_q}. We will establish some connections between algebraic properties of certain graded algebras associated to I and combinatorial optimization properties of certain polyhedrons and clutters associated to A and I respectively. Some applications to Rees algebras and combinatorial optimization are presented. We study a conjecture of Conforti and Cornuéjols using an algebraic approach.
In this paper, we consider monomial curves in ${\mathbb A}_k^3$ parameterized by $t \rightarrow (t^{2q +1}, t^{2q +1 + m}, t^{2q +1 +2 m})$ where $gcd( 2q+1,m)=1$. The symbolic blowup algebras of these monomial curves is Gorenstein (\cite{goto-nis-shim}, \cite{goto-nis-shim-2}). We give a simple proof for the the Gorenstein property for the symbolic blowup algebras of these curves.
In this article, we find the equations defining the Rees algebra for certain Monomial Curves explicitly and use them to prove that the blowup scheme is not smooth. This proves a conjecture of Francia in affirmative, which says that a dimension one prime in a regular local ring is a complete intersection if it has a smooth blowup.
Let $d \geq 2$ and $m\geq 1$ be integers such that $\gcd (d,m)=1.$ Let ${\mathfrak p}$ be the defining ideal of the monomial curve in ${\mathbb A}_{ \Bbbk{k}}^d$ parametrized by $(t^{n_1}, \ldots, t^{n_d})$ where $n_i = d + (i-1)m$ for all $i = 1, \ldots, d$. In this paper, we describe the symbolic powers ${\mathfrak p}^{(n)} $ for all $n \geq 1$. As a consequence we show that the symbolic blowup algebras ${\mathcal R}_s{({\mathfrak p})}$ and $G_{s}({\mathfrak p}) $ are Cohen-Macaulay. This gives a positive answer to a question posed by S.~Goto in \cite{goto}. We also discuss when these blowup…
In this paper we explicitly describe the symbolic powers of curves ${\mathcal C}(q,m)$ in ${\mathbb P}^3$ parametrized by $( x^{d+2m}, x^{d+m} y^m, x^{d} y^{2m}, y^{d+2m})$, where $q,m$ are positive integers, $d=2q+1$ and $\gcd(d,m)=1$. The defining ideal of these curves is a set-theoretic complete intersection. We show that the symbolic blowup algebra is Noetherian and Gorenstein. An explicit formula for the resurgence and the Waldschmidt constant of the prime ideal ${\mathfrak p}:={\mathfrak p}_{ { \mathcal C}(q,m) }$ defining the curve ${\mathcal C}(q,m)$ is computed. We also give a formula…
Gotzmann proved the persistence for minimal growth for ideals. His theorem is called Gotzmann's persistence theorem. In this paper, based on the combinatorics on binomial coefficients, a simple combinatorial proof of Gotzmann's persistence theorem in the special case of monomial ideals is given.
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 define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple combinatorial properties of its labeled hypergraph. We also give specific formulas for the regularity of square-free monomial ideals with certain labeled hypergraphs. Furthermore, we prove results in the case of one-dimensional labeled hypergraphs.
We investigate the Rees algebra and the toric ring of the squarefree monomial ideal associated to the three-dimensional Ferrers diagram. Under the projection property condition, we describe explicitly the presentation ideals of the Rees algebra and the toric ring. We show that the toric ring is a Koszul Cohen--Macaulay normal domain, while the Rees algebra is Koszul and the defining ideal is of fiber type.
We will give a pure combinatorial proof of the Eisenbud-Goto conjecture for arbitrary monomial curves. Moreover, we will show that the conjecture holds for certain simplicial affine semigroup rings.
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…
We give a generalization of Hochster's formula for local cohomologies of square-free monomial ideals to monomial ideals, which are not necessarily square-free. Using this formula, we give combinatorial characterizations of generalized Cohen-Macaulay monomial ideals. We also give other applications of the generalized Hochster's formula.
In this paper we extend one direction of Fröberg's theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the introduction of d-chorded and orientably-d-cycle-complete simplicial complexes. We show that a certain class of simplicial complexes, the d-dimensional trees, correspond to ideals having linear resolutions over fields of characteristic 2 and also give a necessary combinatorial condition for a monomial ideal to be componentwise linear over all fields.
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 combinatorial method to determine if an ideal is a Lyubeznik ideal. Furthermore, the minimality of the Lyubeznik resolution is characterized and we classify all the Lyubeznik symbols using combinatorial criteria. We get a combinatorial expression for the projective dimension, the length of Lyubeznik, and the arithmetical rank of a monomial ideal. We define the Lyubeznik totally ideals as those ideals that yield a mi…
The goal of this paper is to produce a formula for the multiplier ideals of monomial space curves in the spirit of Howald's formula for the multiplier ideals of monomial ideals. This is achieved by constructing a toric blowup of affine space in such a way that a log resolution of the monomial curve may be constructed from this toric variety in a well controlled manner.
We give a combinatorial description of the roots of the Bernstein-Sato polynomial of a monomial ideal using the Newton polyhedron and some semigroups associated to the ideal.
Castelnuovo-Mumford regularity is a measure of algebraic complexity of an ideal. Regularity of monomial ideals can be investigated combinatorially. We use a simple graph decomposition and results from structural graph theory to prove, improve and generalize many of the known bounds on regularity of quadratic square-free monomial ideals.
With a particular focus on explicit computations and applications of the Koszul homology and Betti numbers of monomial ideals, the main goals of this thesis are the following: Analyze the Koszul homology of monomial ideals and apply it to describe the structure of monomial ideals. Describe algorithms to perform efficient computations of the homological invariants of monomial ideals. Apply the theory and computations on monomial ideals to problems inside and outside mathematics The thesis introduces as a main tool Mayer-Vietoris trees of monomial ideals.
In this paper we give a necessary and sufficient combinatorial condition for a monomial ideal to have a linear resolution over fields of characteristic 2. We also give a new proof of Fröberg's theorem over fields of characteristic 2.
B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a linear resolution or being Cohen--Macaulay may be derived from the combinatorial structure of the graph.
Symmetric strongly shifted ideals are a class of monomial ideals which come equipped with an action of the symmetric group and are analogous to the well-studied class of strongly stable monomial ideals. In this paper we focus on algebraic and combinatorial properties of symmetric strongly shifted ideals. On the algebraic side, we elucidate properties that pertain to behavior under ideal operations, primary decomposition, and the structure of their Rees algebra. On the combinatorial side, we develop a notion of partition Borel generators which leads to connections to discrete polymatroids, conv…
One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of monomials defining the inverse can be obtained explicitly in terms of the initial data. A neat consequence is drawn for the plane Cremona monomial group, in particular the known result saying that a plane Cremona (monomial) map and its inverse have the same degree. Included is a discussion about the computational side and/or implementation of the combinatorial inva…
In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work, we will introduce similar techniques, or modify existing ones to obtain two new results. The first is $S[Λ]$-resolutions of $Λ$-invariant submodules of $k[\mathbb{Z}^n]$ where $Λ$ is a lattice in $\mathbb{Z}^n$ satisfying some trivial conditions. A consequence will be the ability to resolve submodules of $k[\mathbb{Z}^n/Λ]$, and in particular ideals $J$ of $…
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with fuller generality, and at the same time, obtain new results. Past investigations on the resolutions of edge ideals usually reduced the problem to computing the dimensions of reduced homology or Koszul homology groups. Our approach circumvents the highly nontrivial problem of computing the dimensions of these groups and turns the problem into combinatorial questio…
In this paper, we introduce the concept of $k$-clean monomial ideals as an extension of clean monomial ideals and present some homological and combinatorial properties of them. Using the hierarchal structure of $k$-clean ideals, we show that a $(d-1)$-dimensional simplicial complex is $k$-decomposable if and only if its Stanley-Reisner ideal is $k$-clean, where $k\leq d-1$. We prove that the classes of monomial ideals like monomial complete intersection ideals, Cohen-Macaulay monomial ideals of codimension 2 and symbolic powers of Stanley-Reisner ideals of matroid complexes are $k$-clean for a…
Scattered over the past few years have been several occurrences of simplicial complexes whose topological behavior characterize the Cohen-Macaulay property for quotients of polynomial rings by arbitrary (not necessarily squarefree) monomial ideals. The purpose of this survey is to gather the developments into one location, with self-contained proofs, including direct combinatorial topological connections between them.
We develop combinatorial tools to study the relationship between the Stanley depth of a monomial ideal $I$ and the Stanley depth of its compliment, $S/I$. Using these results we are able to prove that if $S$ is a polynomial ring with at most 5 indeterminates and $I$ is a square-free monomial ideal, then the Stanley depth of $S/I$ is strictly larger than the Stanley depth of $I$. Using a computer search, we are able to extend this strict inequality up to polynomial rings with at most 7 indeterminates. This partially answers questions asked by Propescu and Qureshi as well as Herzog.
A minimal monomial ideal is the combinatorially simplest monomial ideal whose lcm-lattice equals a given finite atomic lattice $\hat{L}$. The minimal ideal inherits many nice properties of any ideal $I$ whose lcm-lattice also equals $\hat{L}$, e.g. Cohen-Macaulayness and the dual property of having a linear resolution. Conversely, any ideal having a linear resolution is shown to be (essentially) minimal.
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.
We survey research relating algebraic properties of powers of squarefree monomial ideals to combinatorial structures. In particular, we describe how to detect important properties of (hyper)graphs by solving ideal membership problems and computing associated primes. This work leads to algebraic characterizations of perfect graphs independent of the Strong Perfect Graph Theorem. In addition, we discuss the equivalence between the Conforti-Cornuejols conjecture from linear programming and the question of when symbolic and ordinary powers of squarefree monomial ideals coincide.
We construct a generalize Ishida complex to compute the local cohomology with monomial support of modules over quotients of polynomial rings by cellular binomial ideals. As a consequence, we obtain a combinatorial criterion to determine when such a quotient is Cohen--Macaulay. In particular, this gives a Cohen--Macaulayness criterion for lattice ideals. We also prove a result relating the local cohomology with radical monomial ideal support of an affine semigroup ring to the local cohomology with maximal ideal support of the quotient of the affine semigroup ring by the radical monomial ideal. …
The construction of joins and secant varieties is studied in the combinatorial context of monomial ideals. For ideals generated by quadratic monomials, the generators of the secant ideals are obstructions to graph colorings, and this leads to a commutative algebra version of the Strong Perfect Graph Theorem. Given any projective variety and any term order, we explore whether the initial ideal of the secant ideal coincides with the secant ideal of the initial ideal. For toric varieties, this leads to the notion of delightful triangulations of convex polytopes.
Parking functions are a widely studied class of combinatorial objects, with connections to several branches of mathematics. On the algebraic side, parking functions can be identified with the standard monomials of $M_n$, a certain monomial ideal in the polynomial ring $S = {\mathbb K}[x_1, \dots, x_n]$ where a set of generators are indexed by the nonempty subsets of $[n] = \{1,2,\dots,n\}$. Motivated by constructions from the theory of chip-firing on graphs we study generalizations of parking functions determined by $M^{(k)}_n$, a subideal of $M_n$ obtained by allowing only generators correspo…
Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{K}$. In 1982, R. Stanley associated a combinatorial invariant to any finitely generated $\mathbb{Z}^n$-graded $S$-module which is now called Stanley depth. Stanley conjectured that this invariant is an upper bound for the depth of module. Stanley's conjecture has been disproved by Duval et al. \cite{abcj}, and the counterexample is a quotient of squarefree monomial ideals. On the other hand, there are evidences showing that Stanley's inequality can be true for high powers of mono…
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.
Let $G$ be an (oriented) graph on the vertex set $V = \{ 0, 1,\ldots,n\}$ with root $0$. Postnikov and Shapiro associated a monomial ideal $\mathcal{M}_G$ in the polynomial ring $ R = {\mathbb{K}}[x_1,\ldots,x_n]$ over a field $\mathbb{K}$. A subideal $\mathcal{M}_G^{(k)}$ of $\mathcal{M}_G$ generated by subsets of $\widetilde{V}=V\setminus \{0\}$ of size at most $k+1$ is called a $k$-skeleton ideal of the graph $G$. Many interesting homological and combinatorial properties of $1$-skeleton ideal $\mathcal{M}_G^{(1)}$ are obtained by Dochtermann for certain classes of simple graph $G$. A finite…
In this work a combinatorial approach towards the weak Lefschetz property is developed that relates this property to enumerations of signed perfect matchings as well as to enumerations of signed families of non-intersecting lattice paths in certain triangular regions. This connection is used to study Artinian quotients by monomial ideals of a three-dimensional polynomial ring. Extending a main result in the recent memoir [Boij, Migliore, Miró-Roig, Nagel, Zanello], we completely classify the quotients of type two that have the weak Lefschetz property in characteristic zero. We also derive resu…
Given a graph $G$, the $G$-parking function ideal $M_G$ is an artinian monomial ideal in the polynomial ring $S$ with the property that a linear basis for $S/M_G$ is provided by the set of $G$-parking functions. It follows that the dimension of $S/M_G$ is given by the number of spanning trees of $G$, which by the Matrix Tree Theorem is equal to the determinant of the reduced Laplacian of $G$. The ideals $M_G$ and related algebras were introduced by Postnikov and Shapiro where they studied their Hilbert functions and homological properties. The author and Sanyal showed that a minimal resolution…
We survey a number of recent studies of the Castelnuovo-Mumford regularity of squarefree monomial ideals. Our focus is on bounds and exact values for the regularity in terms of combinatorial data from associated simplicial complexes and/or hypergraphs.
A tame ideal is an ideal $I$ such that the blowup of the affine space $\mathbb{A}_k^n$ along $I$ is regular. In this paper, we give a combinatorial characterization of tame squarefree monomial ideals. More precisely, we show that a square free monomial ideal is tame if and only if the corresponding clutter is a union of some isolated vertices and a complete $d$-partite $d$-uniform clutter. It turns out that a squarefree monomial ideal is tame, if and only if the facets of its Stanley-Reisner complex have mutually disjoint complements. Also, we characterize all monomial ideals generated in degr…
We present two new problems on lower bounds for resolution Betti numbers of monomial ideals generated in a fixed degree. The first concerns any such ideal and bounds the total Betti numbers, while the second concerns ideals that are quadratic and bihomogeneous with respect to two variable sets, but gives a more finely graded lower bound. These problems are solved for certain classes of ideals that generalize (in two different directions) the edge ideals of threshold graphs and Ferrers graphs. In the process, we produce particularly simple cellular linear resolutions for strongly stable and squ…
The Riemann-Roch theorem on a graph G is related to Alexander duality in combinatorial commutive algebra. We study the lattice ideal given by chip firing on G and the initial ideal whose standard monomials are the G-parking functions. When G is a saturated graph, these ideals are generic and the Scarf complex is a minimal free resolution. Otherwise, syzygies are obtained by degeneration. We also develop a self-contained Riemann-Roch theory for artinian monomial ideals.
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 introduce an exact functor defined on multigraded modules which we call the expansion functor and study its homological properties. The expansion functor applied to a monomial ideal amounts to substitute the variables by monomial prime ideals and to apply this substitution to the generators of the ideal. This operation naturally occurs in various combinatorial contexts.
We present combinatorial characterizations for the associated primes of the second power of squarefree monomial ideals and criteria for this power to have positive depth or depth greater than one.
We introduce a construction, called linearization, that associates to any monomial ideal $I$ an ideal $\mathrm{Lin}(I)$ in a larger polynomial ring. The main feature of this construction is that the new ideal $\mathrm{Lin}(I)$ has linear quotients. In particular, since $\mathrm{Lin}(I)$ is generated in a single degree, it follows that $\mathrm{Lin}(I)$ has a linear resolution. We investigate some properties of this construction, such as its interplay with classical operations on ideals, its Betti numbers, functoriality and combinatorial interpretations. We moreover introduce an auxiliary const…
Two-dimensional squarefree monomial ideals can be seen as the Stanley-Reisner ideals of graphs. The main results of this paper are combinatorial characterizations for the Cohen-Macaulayness of ordinary and symbolic powers of such an ideal in terms of the associated graph.
We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except for the last step (the "almost linear" case). We also give sharp bounds on Castelnuovo-Mumford regularity and numbers of generators in some cases. It is a basic observation that linearity properties are inherited by the restriction of an ideal to a subset of variables, and we study when the converse holds. We construct fractal examples of almost linear prima…
An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional generalizations of combined spanning trees for cycles and cocycles ("hedges") in the upper Koszul simplicial complexes of $I$ at lattice points in $\mathbb{Z}^n$. The differentials in these "sylvan resolutions" are expressed as matrices whose entries are sums over lattice paths of weights determined combinatorially by sequences of hedges ("hedgerows") along each lattice…
We explore the dependence of the Betti numbers of monomial ideals on the characteristic of the field. A first observation is that for a fixed prime $p$ either the $i$-th Betti number of all high enough powers of a monomial ideal differs in characteristic $0$ and in characteristic $p$ or it is the same for all high enough powers. In our main results we provide constructions and explicit examples of monomial ideals all of whose powers have some characteristic-dependent Betti numbers or whose asymptotic regularity depends on the field. We prove that, adding a monomial on new variables to a monomi…
Let C be a clutter and let A be its incidence matrix. If the linear system x>=0;xA<=1 has the integer rounding property, we give a description of the canonical module and the a-invariant of certain normal subrings associated to C. If the clutter is a connected graph, we describe when the aforementioned linear system has the integer rounding property in combinatorial and algebraic terms using graph theory and the theory of Rees algebras. As a consequence we show that the extended Rees algebra of the edge ideal of a bipartite graph is Gorenstein if and only if the graph is unmixed.
In 1995 Villarreal gave a combinatorial description of the equations of Rees algebras of quadratic squarefree monomial ideals. His description was based on the concept of closed even walks in a graph. In this paper we will generalize his results for all squarefree monomial ideals by using a definition of even walks in a simplicial complex.
