Related papers: On monomial ideals and their socles

We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…

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…

Let $I\subset R=K[x_1, \ldots, x_n]$ be a square-free monomial ideal, $\mathfrak{q}$ be a prime monomial ideal in $R$, $h$ be a square-free monomial in $R$ with $\mathrm{supp}(h) \cap (\mathrm{supp}(\mathfrak{q}) \cup…

The support poset of a monomial ideal $I\subseteq\mathbf{k}[x_1,\dots,x_n]$ encodes the relation between the variables $x_1,\dots,x_n$ and the minimal monomial generators of $I$. It is known that not every poset is realizable as the support…

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…

Let $M$ be a monoid that is embeddable in a group. We consider the topos $\mathbf{PSh}(M)$ of sets equipped with a right $M$-action, and we study the subtoposes that are of monoid type, i.e. the subtoposes that are again of the form…

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

In this paper we investigate the monomial ideals which satisfy the copersistence property or nearly copersistence property.

Let $k$ be a field of characteristic zero, and $R=k[x_1, \ldots, x_d]$ with $d \geq 3$ be a polynomial ring in $d$ variables. Let $\m=(x_1, \ldots, x_d)$ be the homogeneous maximal ideal of $R$. Let $\mathcal{K}$ be the kernel of the…

We introduce the class of lattice-linear monomial ideals and use the LCM-lattice to give an explicit construction for their minimal free resolution. The class of lattice-linear ideals includes (among others) the class of monomial ideals…

In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…

The shedding vertices of simplicial complexes are studied from an algebraic point of view. Based on this perspective, we introduce the class of ass-decomposable monomial ideals which is a generalization of the class of Stanley-Reisner…

For an ideal $I$ in a polynomial ring over a field, a monomial support of $I$ is the set of monomials that appear as terms in a set of minimal generators of $I$. Craig Huneke asked whether the size of a monomial support is a bound for the…

We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…

We construct a (shellable) polyhedral cell complex that supports a minimal free resolution of a Borel fixed ideal, which is minimally generated (in the Borel sense) by just one monomial in S=k[x_1,x_2,...,x_n]; this includes the case of…

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…

In this article we give explicit descriptions of the multiplicities of some classes of monomial ideals. For instance, we give a formula for the multiplicities of all codimension 1 monomial ideals, and another formula for the multiplicities…

In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated LCM lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial…

The reduction number of monomial ideals in the polynomial $K[x,y]$ is studied. We focus on ideals $I$ for which $J=(x^a,y^b)$ is a reduction ideal. The computation of the reduction number amounts to solve linear inequalities. In some…

When a monomial ideal has linear quotients with respect to an admissible order of increasing support-degree, we provide two proofs of different flavors to show that it is componentwise support-linear. We also introduce the variable…