Related papers: Depth and regularity of monomial ideals via polari…

This paper is concerned with the question of whether geometric structures such as cell complexes can be used to simultaneously describe the minimal free resolutions of all powers of a monomial ideal. We provide a full answer in the case of…

In this paper we provide some precise formulas for regularity of powers of edge ideal of the disjoint union of some weighted oriented gap-free bipartite graphs. For the projective dimension of such an edge ideal, we give its exact formula.…

We show that all monomial ideals in the polynomial ring in at most 3 variables are pretty clean and that an arbitrary monomial ideal $I$ is pretty clean if and only if its polarization $I^p$ is clean. This yields a new characterization of…

Multibang regularization and combinatorial integral approximation decompositions are two actively researched techniques for integer optimal control. We consider a class of polyhedral functions that arise particularly as convex lower…

Given a Noetherian ring $A$, the collection of all integrally closed ideals in $A$ which contain a nonzerodivisor, denoted $ic(A)$, forms a cancellative monoid under the operation $I*J=\overline{IJ}$, the integral closure of the product.…

This paper demonstrates that extremal ideals can be used to great effect to compute integral closures of powers and symbolic powers of square-free monomial ideals. We show that the generators of these powers are images of the generators of…

Let $I$ be the edge ideal of a Cohen-Macaulay tree of dimension $d$ over a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_{d},y_1,\ldots,y_d]$. We prove that for all $t \ge 1$, $$\operatorname{depth} (S/I^t) = \operatorname{max} \{d -t + 1, 1…

Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field $K$ with the maximal ideal $\frak{m}=(x_1,...,x_n)$. Let $\astab(I)$ and $\dstab(I)$ be the smallest integer $n$ for which $\Ass(I^n)$ and $\depth(I^n)$ stabilize,…

If C is a clutter with n vertices and q edges whose clutter matrix has column vectors V={v1,...,vq}, we call C an Ehrhart clutter if {(v1,1),...,(vq,1)} is a Hilbert basis. Letting A(P) be the Ehrhart ring of P=conv(V), we are able to show…

Assume that $G$ is a graph with edge ideal $I(G)$ and star packing number $\alpha_2(G)$. We denote the $s$-th symbolic power of $I(G)$ by $I(G)^{(s)}$. It is shown that the inequality ${\rm depth} S/(I(G)^{(s)})\geq \alpha_2(G)-s+1$ is true…

In this article, we investigate the combinatorial and algebraic properties of the lcm-lattice associated with the edge ideal of a hypergraph. Let $\H$ be a hypergraph, $I(\H)$ its corresponding edge ideal in a polynomial ring in $n$…

An ideal $I$ in a Noetherian ring is called \textit{normal} if $I^n$ is integrally closed for all $n \geq 1$. Zariski proved that in two-dimensional regular local rings, every integrally closed ideal is normal. However, in dimension three…

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…

The aim of this work is to use linear programming and polyhedral geometry to prove a duality formula for the ic-resurgence of edge ideals. We show that the ic-resurgence of the edge ideal $I$ of a clutter $\mathcal{C}$ and the ic-resurgence…

In this paper we show that the Stanley depth, as well as the usual depth, are essentially determined by the lcm-lattice. More precisely, we show that for quotients $I/J$ of monomial ideals $J\subset I$, both invariants behave monotonic with…

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

We define the uniform face ideal of a simplicial complex with respect to an ordered proper vertex colouring of the complex. This ideal is a monomial ideal which is generally not squarefree. We show that such a monomial ideal has a linear…

Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…

In this paper,we introduce the monomial ideals I(H) associated to a special class of non uniform hypergraphs H(X; E; d) namely uniformly increasing hypergraphs. These ideals are named as inclusion ideals. In this paper, we discuss some…

This paper concerns the study of a class of clutters called simplicial subclutters. Given a clutter $\mathcal{C}$ and its simplicial subclutter $\mathcal{D}$, we compare some algebraic properties and invariants of the ideals $I, J$…