相关论文: On a class of squarefree monomial ideals of linear…
Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…
A square-free monomial ideal $I$ of $k[x_1,\ldots,x_n]$ is said to be an $f$-ideal if the facet complex and non-face complex associated with $I$ have the same $f$-vector. We show that $I$ is an $f$-ideal if and only if its Newton…
The free resolution and the Alexander dual of squarefree monomial ideals associated with certain subsets of distributive lattices are studied.
We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…
Linear resolutions and the stronger notion of linear quotients are important properties of monomial ideals. In this paper, we fully characterize linear quotients in terms of the lcm-lattice of monomial ideals. We also formulate an analogous…
Ideals in infinite-dimensional polynomial rings that are invariant under the action of the monoid of increasing functions have been extensively studied recently. Of particular interest is the asymptotic behavior of truncations of such an…
In this paper we study the behavior of the size of a monomial ideal under polarization and under generic deformations. As an application, we extend a result relating the size and the Stanley depth of a squarefree monomial ideal obtained by…
We have recently proved a precise relation between Bernstein-Sato ideals of collections of polynomials and monodromy of generalized nearby cycles. In this article we extend this result to other ideals of Bernstein-Sato type.
Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…
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$…
We compute the mapping class group-valued monodromy of any sufficiently ample linear system on any smooth simply connected projective surface, identifying this with the r-spin mapping class group associated to a maximal root of the adjoint…
Symmetric strongly shifted ideals are a class of monomial ideals which come equipped with an action of the symmetric group and are analogous to the well-studied class of strongly stable monomial ideals. In this paper we focus on algebraic…
Given a squarefree monomial ideal $I \subseteq R =k[x_1,\ldots,x_n]$, we show that $\widehat\alpha(I)$, the Waldschmidt constant of $I$, can be expressed as the optimal solution to a linear program constructed from the primary decomposition…
We generalize the cohomology theory for linear cycle sets introduced by Lebed and Vendramin. Our cohomology classifies extensions of linear cycle sets by trivial ideals, whereas the cohomology of Lebed and Vendramin only deals with central…
We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…
Let I=(x^{v_1},...,x^{v_q} be a square-free monomial ideal of a polynomial ring K[x_1,...,x_n] over an arbitrary field K and let A be the incidence matrix with column vectors {v_1},...,{v_q}. We will establish some connections between…
Let $K$ be a field, $V$ a finite dimensional $K$-vector space and $E$ the exterior algebra of $V$. We analyze iterated mapping cone over $E$. If $I$ is a monomial ideal of $E$ with linear quotients, we show that the mapping cone…
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…
If $J\subset I$ are two monomials ideals, we give a practical upper bound for the Stanley depth of $J/I$, which we call it the \emph{quasi-depth} of $J/I$. Also, we compute the quasi-depth of several classes of square free monomial ideals.…
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…