Related papers: Monomial ideals with linear quotients and componen…
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…
In analogy to the skeletons of a simplicial complex and their Stanley--Reisner ideals we introduce the skeletons of an arbitrary monomial ideal $I\subset S=K[x_1,...,x_n]$. This allows us to compute the depth of $S/I$ in terms of its…
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…
Let S be a polynomial ring in n variables, over an arbitrary field. We give the total, graded, and multigraded Betti numbers of S/M, for every monomial ideal M in S. We also give an explicit characterization of all monomial ideals M in S…
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
In this paper, we study the componentwise linearity of symbolic powers of edge ideals. We propose the conjecture that all symbolic powers of the edge ideal of a cochordal graph are componentwise linear. This conjecture is verified for some…
Monadic decomposability is a notion of variable independence, which asks whether a given formula in a first-order theory is expressible as a Boolean combination of monadic predicates in the theory. Recently, Veanes et al. showed the…
As a higher analogue of the edge ideal of a graph, we study the $t$-connected ideal $\operatorname{J}_{t}$. This is the monomial ideal generated by the connected subsets of size $t$. For chordal graphs, we show that $\operatorname{J}_{t}$…
In the present paper we prove that all homogeneous ideals with linear quotients are componentwise linear. Moreover we establish an extended version of Eliahou-Kervaire formula for graded Betti numbers.
In this article we study the combinatorics of congruence subgroups of the modular group. We consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of Coxeter friezes),…
Cubic forms in three variables are parametrised by points of $\P^9$. We study the subvarieties in this space defined by decomposable forms. Specifically, we calculate the equivariant minimal resolutions of these varieties and describe their…
In dimension two, we study complete monomial ideals combinatorially, their Rees algebras and develop effective means to find their defining equations.
We introduce the notion of sortability and $t$-sortability for a simplicial complex and study the graphs for which their independence complexes are either sortable or $t$-sortable. We show that the proper interval graphs are precisely the…
We study ideal-theoretic conditions for a monomial ideal to be Golod. For ideals in a polynomial ring in three variables, our criteria give a complete characterization. Over such rings, we show that the product of two monomial ideals is…
We investigate symbolic and regular powers of monomial ideals. For a square-free monomial ideal $I$ in $k[x_0, \ldots, x_n]$ we show $I^{t(m+e-1)-e+r)}$ is a subset of $M^{(t-1)(e-1)+r-1}(I^{(m)})^t$ for all positive integers $m$, $t$ and…
It is known that an ideal of a direct product of commutative unitary rings is directly decomposable into ideals of the corresponding factors. We show that this does not hold in general for commutative rings and we find necessary and…
In this article, we study the combinatorics of congruence subgroups of the modular group. More precisely, we consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of…
We find explicit bounds on the primary components and on the Castelnuovo-Mumford regularity of powers of monomial ideals. We also analyze the primary decompositions of Katzman's example.
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…
In this paper, we study the componentwise linearity of edge ideals of weighted oriented graphs. We show that if $D$ is a weighted oriented graph whose edge ideal $I(D)$ is componentwise linear, then the underlying simple graph $G$ of $D$ is…