相关论文: A Combinatorial Algorithm to Find the Minimal Free…
An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional…
We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…
Let $I$ be a monomial ideal in two variables generated by three monomials and let $\mathcal{R}(I)$ be its Rees ideal. We describe an algorithm to compute the minimal generating set of $\mathcal{R}(I)$. Based on the data obtained by this…
Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…
The Koszul homology of modules of the polynomial ring $R$ is a central object in commutative algebra.It is strongly related with the minimal free resolution of these modules, and thus with regularity, Hilbert functions, etc. Here we…
We present a procedure that constructs, in a combinatorial manner, a chain complex of free modules over a polynomial ring in finitely many variables, modulo an ideal generated by quadratic monomials. Applying this procedure to two specific…
In this paper we construct a combinatorial algorithm of resolution of singularities for binomial ideals, over a field of arbitrary characteristic. This algorithm is applied to any binomial ideal. This means ideals generated by binomial…
Let $S = K[x_1, \dots, x_n]$ be the standard graded polynomial ring over a field $K$. In this paper, we address and completely solve two fundamental open questions in Commutative Algebra: (i) For which degrees $d$, does there exist a…
Call a monomial ideal M "generic" if no variable appears with the same nonzero exponent in two distinct monomial generators. Using a convex polytope first studied by Scarf, we obtain a minimal free resolution of M. Any monomial ideal M can…
Let $ X $ be an $ m \times n $ matrix of distinct indeterminates over a field $ K $, where $ m \le n $. Set the polynomial ring $ K[X] := K[X_{ij} : 1 \le i \le m, 1 \le j \le n] $. Let $ 1 \le k < l \le n $ be such that $ l - k + 1 \ge m…
A canonical minimal free resolution of an arbitrary co-artinian lattice ideal over the polynomial ring is constructed over any field whose characteristic is 0 or any but finitely many positive primes. The differential has a closed-form…
Let M in k[x,y] be a monomial ideal M=(m_1,m_2,...,m_r), where the m_i are a minimal generating set of M. We construct an explicit free resolution of k over S=k[x,y]/M for all monomial ideals M, and provide recursive formulas for the Betti…
In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set \Lambda_n^k consisting of all n\times n…
We construct a canonical free resolution for arbitrary monomial modules and lattice ideals. This includes monomial ideals and defining ideals of toric varieties, and it generalizes our joint results with Irena Peeva for generic ideals.
Let $I_1,\dots,I_n$ be ideals generated by linear forms in a polynomial ring over an infinite field and let $J = I_1 \cdots I_n$. We describe a minimal free resolution of $J$ and show that it is supported on a polymatroid obtained from the…
To any lattice $L \subset \mathbb{Z}^{m}$ one can associate the lattice ideal $I_{L} \subset K[x_{1},...,x_{m}]$. This paper concerns the study of the relation between the binomial arithmetical rank and the minimal number of generators of…
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…
Given $\Sigma\subset\mathbb K[x_1,\ldots,x_k]$, any finite collection of linear forms, some possibly proportional, and any $1\leq a\leq |\Sigma|$, it has been conjectured that $I_a(\Sigma)$, the ideal generated by all $a$-fold products of…
Let R be the quotient of a polynomial ring over a field k by an ideal generated by monomials. We derive a formula for the multigraded Poincare' series of R, i.e., the generating function for the ranks of the modules in a minimal multigraded…