Related papers: Stanley depth of complete intersection monomial id…
Let $J_{n,m}:=(x_1x_2\cdots x_m,\; x_2x_3\cdots x_{m+1},\; \ldots,\; x_{n-m+1}\cdots x_n,\; x_{n-m+2}\cdots x_nx_1, \ldots, x_nx_1\cdots x_{m-1})$ be the $m$-path ideal of the cycle graph of length $n$, in the ring $S=K[x_1,\ldots,x_n]$.…
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…
A squarefree monomial ideal is called an $f$-ideal if its Stanley-Reisner and facet simplicial complexes have the same $f$-vector. We show that $f$-ideals generated in a fixed degree have asymptotic density zero when the number of variables…
In dimension two, we study complete monomial ideals combinatorially, their Rees algebras and develop effective means to find their defining equations.
Let $G$ be a graph on the vertex set $[n]$ and $J_G$ the associated binomial edge ideal in the polynomial ring $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$. In this paper we investigate the depth of binomial edge ideals. More precisely, we…
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…
The arithmetic rank of an ideal in a polynomial ring over an algebraically closed field is the smallest number of equations needed to define its vanishing locus set-theoretically. We determine the arithmetic rank of the generic $m$-residual…
In 2017, Cooper et al. proposed a conjecture providing a lower bound for the Waldschmidt constant of monomial ideals. We confirm this conjecture for some classes of monomial ideals. Recently, M\'endez, Pinto, and Villarreal formulated a…
Schemes defined by residual intersections have been extensively studied in the case when they are Cohen-Macaulay, but this is a very restrictive condition. In this paper we make the first study of a class of natural examples far from…
Monomial ideals which are generic with respect to either their generators or irreducible components have minimal free resolutions derived from simplicial complexes. For a generic monomial ideal, the associated primes satisfy a saturated…
We characterize componentwise linear monomial ideals with minimal Taylor resolution and consider the lower bound for the Betti numbers of componentwise linear ideals.
We study the regularity of symbolic powers of square-free monomial ideals. We prove that if $I = I_\Delta$ is the Stanley-Reisner ideal of a simplicial complex $\Delta$, then $\reg(I^{(n)}) \leqslant \delta(n-1) +b$ for all $n\geqslant 1$,…
We investigate an invariant, called the Serre depth, from the perspective of combinatorial commutative algebra. In this paper, we establish several properties of an analogue of the depth of Stanley-Reisner rings. In particular, we relate…
In this paper we derive some conditions for transversal intersection of polynomial ideals. We exhibit some examples. Finally, as an application of the results proved, we compute the Betti numbers for ideals of the form $I_{1}(XY) + J$,…
An ideal of polynomials is symmetric if it is closed under permutations of variables. We relate general symmetric ideals to the so called Specht ideals generated by all Specht polynomials of a given shape. We show a connection between the…
Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible decompositions, Alexander duals and socles of monomial…
One of the fundamental invariants connecting algebra and geometry is the degree of an ideal. In this paper we derive the probabilistic behavior of degree with respect to the versatile Erd\H{o}s-R\'enyi-type model for random monomial ideals…
A method for computing the multigraded Hilbert depth of a module was presented in [16]. In this paper we improve the method and we introduce an effective algorithm for performing the computations. In a particular case, the algorithm may…
We introduce the concept of quasi-linearity and prove it is necessary for a monomial ideal to have a linear resolution and identify all the quasi-linear quadratic monomial ideals. We define a strongly linear monomial for a monomial ideal…