Related papers: Monomial cut ideals
Addressing a question of M. Stillman, it had been shown by Ein, Eisenbud, and the author that in a projective space of dimension at most 5, every arithmetically Cohen-Macaulay curve which is cut out by quadrics scheme- theoretically also…
We show that any lexsegment ideal with linear resolution has linear quotients with respect to a suitable ordering of its minimal monomial generators. For completely lexsegment ideals with linear resolution we show that the decomposition…
Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the primitive, the minimal, the indispensable and the fundamental binomials of the toric ideal $I_G$.
We prove the multiplicity bounds conjectured by Herzog-Huneke-Srinivasan and Herzog-Srinivasan in the following cases: the strong conjecture for edge ideals of bipartite graphs, and the weaker Taylor bound conjecture for all quadratic…
In a 2008 paper, the first author and Van Tuyl proved that the regularity of the edge ideal of a graph G is at most one greater than the matching number of G. In this note, we provide a generalization of this result to any square-free…
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…
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…
As a higher analogue of the edge ideal of a graph, we study the $t$-connected ideal $\operatorname{J}_{t}$. This is the monomial ideal generated by the connected subsets of size $t$. For chordal graphs, we show that $\operatorname{J}_{t}$…
In the first part of this paper we study scrollers and linearly joined varieties. A particular class of varieties, of important interest in classical Geometry are Cohen--Macaulay varieties of minimal degree. They appear naturally studying…
Let $G$ be a simple graph on the vertex set $\{1,\ldots,n\}$ with $m$ edges. An algebraic object attached to $G$ is the ideal $P_{G}$ generated by diagonal 2-minors of an $n \times n$ matrix of variables. In this paper we prove that if $G$…
Fr\"oberg's classical theorem about edge ideals with $2$-linear resolution can be regarded as a classification of graphs whose edge ideals have linearity defect zero. Extending his theorem, we classify all graphs whose edge ideals have…
Inspired by the notion of K\"onig graphs we introduce graded ideals of K\"onig type with respect to a monomial order $<$. It is shown that if $I$ is of K\"onig type, then the Cohen--Macaulay property of $\ini_<(I)$ does not depend on the…
In this article, we study algebraic properties of binomial edge ideals of Levi graphs associated with certain plane curve arrangements. Using combinatorial properties of Levi graphs, we discuss the Cohen-Macaulayness of binomial edge ideals…
We find an explicit expression of the associated primes of monomial ideals as a colon by an element $v$, using the unique irredundant irreducible decomposition whose irreducible components are monomial ideals (Theorem 3.1). An algorithm to…
We present criteria for the Cohen-Macaulayness of a monomial ideal in terms of its primary decomposition. These criteria allow us to use tools of graph theory and of linear programming to study the Cohen-Macaulayness of monomial ideals…
In this work we study how some elementary graph operations (like the disjoint union) and the collapse of two vertices modify the cut ideal of a graph. They pave the way for reducing the cut ideal of every graph to the cut ideal of smaller…
Given a tree T on n vertices, there is an associated ideal I of a polynomial ring in n variables over a field, generated by all paths of a fixed length of T. We show that such an ideal always satisfies the Konig property and classify all…
We study the problem when an ideal generated by adjacent 2-minors is the toric ideal of a finite graph.
We recall a numerical criteria for Cohen--Macaulayness related to system of parameters, and introduce monomial ideals of K\"onig type which include the edge ideals of K\"onig graphs. We show that a monomial ideal is of K\"onig type if and…
To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By…