Related papers: The combinatorial calculation of algebraic invaria…
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 paper, we provide a combinatorial criteria for equigenerated monomial ideals in three variables to have linear resolutions. As a consequence, we prove that in three variables, equigenerated monomial ideals with linear resolutions…
We introduce the class of principal symmetric ideals, which are ideals generated by the orbit of a single polynomial under the action of the symmetric group. Fixing the degree of the generating polynomial, this class of ideals is…
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…
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…
A celebrated theorem of Fr\"oberg gives a complete combinatorial classification of quadratic square-free monomial ideals with a linear resolution. A generalization of this theorem to higher degree square-free monomial ideals is an active…
In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…
The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…
We introduce a construction, called linearization, that associates to any monomial ideal $I$ an ideal $\mathrm{Lin}(I)$ in a larger polynomial ring. The main feature of this construction is that the new ideal $\mathrm{Lin}(I)$ has linear…
We construct the minimal resolutions of three classes of monomial ideals: dominant, 1-semidominant, and 2-semidominant ideals. The families of dominant and 1-semidominant ideals extend those of complete and almost complete intersections. We…
In this paper we give a necessary and sufficient combinatorial condition for a monomial ideal to have a linear resolution over fields of characteristic 2. We also give a new proof of Fr\"oberg's theorem over fields of characteristic 2.
We give a necessary and sufficient condition on a homogeneous polynomial ideal for its Taylor complex to be exact. Then we give a combinatorial construction of a minimal resolution for ideals satisfying the above condition (in particular…
B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a…
We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…
The properties of the intersection algebra of two principal monomial ideals in a polynomial ring are investigated in detail. Results are obtained regarding the Hilbert series and the canonical ideal of the intersection algebra using methods…
Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…
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…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
Taylor presented an explicit resolution for arbitrary monomial ideals. Later, Lyubeznik found that already a subcomplex defines a resolution. We show that the Taylor resolution may be obtained by repeated application of the Schreyer Theorem…
In this article we study the Golod property of standard graded algebras. We show that determinantal ideals, binomial edge ideals, and permanental ideals are Golod if and only if they have a linear resolution. Next, we give a…