Related papers: Monomial cut ideals

Let $S = K[x_1,..., x_n]$ be a polynomial ring over a field $K$. Let $I(G) \subseteq S$ denote the edge ideal of a graph $G$. We show that the $\ell$th symbolic power $I(G)^{(\ell)}$ is a Cohen-Macaulay ideal (i.e., $S/I(G)^{(\ell)}$ is…

The main purpose of this paper is to introduce and study minimal and maximal ideals defined on ideal topological spaces. Also, we define and investigate the concepts of ideal quotient and annihilator of any subfamily of $2^X$, where $2^X$…

This is an exposition of some new results on associated primes and the depth of different kinds of powers of monomial ideals in order to show a deep connection between commutative algebra and some objects in combinatorics such as simplicial…

Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…

A signed graph is a pair $(G,\tau)$ of a graph $G$ and its sign $\tau$, where a \textit{sign} $\tau$ is a function from $\{ (e,v)\mid e\in E(G),v\in V(G), v\in e\}$ to $\{1,-1\}$. Note that graphs or digraphs are special cases of signed…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

Let $I(G_{\mathbf{w}})$ be the edge ideal of an edge-weighted graph $(G,\mathbf{w})$. We prove that $I(G_{\mathbf{w}})$ is sequentially Cohen-Macaulay for all weight functions $w$ if and only if $G$ is a Woodroofe graph.

Connected bipartite graphs whose binomial edge ideals are Cohen--Macaulay have been classified by Bolognini et al. In this paper, we compute the depth, Castelnuovo--Mumford regularity, and dimension of the generalized binomial edge ideals…

In this paper we study monomial ideals attached to posets, introduce generalized Hibi rings and investigate their algebraic and homological properties. The main tools to study these objects are Groebner basis theory, the concept of…

Let $I_n$ be the ideal of all algebraic relations on the slopes of the $\binom{n}{2}$ lines formed by placing $n$ points in a plane and connecting each pair of points with a line. Under each of two natural term orders, the initial ideal of…

We introduce and study monomial ideals with regular quotients, which can be seen as an extension of monomial ideals with linear quotients. Based on these investigations, we are able to calculate the Betti numbers of toric ideals belonging…

Many algebras are expected to have the Weak Lefschetz property though this is often very difficult to establish. We illustrate the subtlety of the problem by studying monomial and some closely related ideals. Our results exemplify the…

We prove that the graph of a discontinuous $n$-monomial function $f:\mathbb{R}\to\mathbb{R}$ is either connected or totally disconnected. Furthermore, the discontinuous monomial functions with connected graph are characterized as those…

Let $I(G)$ be the edge ideal of a simple graph $G$. In this paper, we will give sufficient and necessary combinatorial conditions of $G$ in which the second symbolic and ordinary power of its edge ideal are Cohen-Macaulay (resp. Buchsbaum,…

We show how to lift any monomial ideal J in n variables to a saturated ideal I of the same codimension in n+t variables. We show that I has the same graded Betti numbers as J and we show how to obtain the matrices for the resolution of I.…

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-Macaulay clutter C1 satisfying the packing property (resp.…

Given any equigenerated monomial ideal $I$ with the property that the defining ideal $J$ of the fiber cone $ F(I)$ of $I$ is generated by quadratic binomials, we introduce a matrix such that the set of its binomial $2$-minors is a…

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}$.…

LCM lattices were introduced by Gasharov, Peeva, and Welker as a way to study minimal free resolutions of monomial ideals. All LCM lattices are atomic and all atomic lattices arise as the LCM lattice of some monomial ideal. We…

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a…