Related papers: Cohen-Macaulay Monomial Ideals of Codimension 2
In the present paper, we investigate a conjecture of J\"urgen Herzog. Let $S$ be a local regular ring with residue field $K$ or a positively graded $K$-algebra, $I\subset S$ be a perfect ideal of grade two, and let $R=S/I$ with canonical…
We give a generalization of Hochster's formula for local cohomologies of square-free monomial ideals to monomial ideals, which are not necessarily square-free. Using this formula, we give combinatorial characterizations of generalized…
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…
In this paper we give new upper bounds on the regularity of edge ideals whose resolutions are k-steps linear; surprisingly, the bounds are logarithmic in the number of variables. We also give various bounds for the projective dimension of…
In this paper, we study rooted products of graphs from the perspective of combinatorial commutative algebra. For edge ideals, we introduce the 2-Cohen-Macaulayness with respect to a vertex and use it to investigate when edge ideals of…
We describe the typical homological properties of monomial ideals defined by random generating sets. We show that, under mild assumptions, random monomial ideals (RMI's) will almost always have resolutions of maximal length; that is, the…
In this paper, structural properties of chordal graphs are analysed, in order to establish a relationship between these structures and integer Laplacian eigenvalues. We present the characterization of chordal graphs with equal vertex and…
Using the connections among almost complete intersection schemes, arithmetically Gorenstein schemes and schemes that are union of complete intersections we give a structure theorem for arithmetically Cohen-Macaulay union of two complete…
We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…
We prove that the monoidal 2-category of cospans of finite linear orders and surjections is the universal monoidal category with an object X with a semigroup and a cosemigroup structures, where the two structures satisfy a certain…
A central question in liaison theory asks whether every Cohen-Macaulay, graded ideal of a standard graded K-algebra belongs to the same G-liaison class of a complete intersection. In this paper we answer this question positively for toric…
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…
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
Given two determinantal rings over a field k. We consider the Rees algebra of the diagonal ideal, the kernel of the multiplication map. The special fiber ring of the diagonal ideal is the homogeneous coordinate ring of the join variety.…
We extend the definition of chordal from graphs to clutters. The resulting family generalizes both chordal graphs and matroids, and obeys many of the same algebraic and geometric properties. Specifically, the independence complex of a…
In the present note we study certain arrangements of codimension $2$ flats in projective spaces, we call them "Fermat arrangements". We describe algebraic properties of their defining ideals. In particular, we show that they provide…
We prove the multiplicity bounds conjectured by Herzog-Huneke-Srinivasan and Herzog-Srinivasan in the following cases: the strong conjecture for edge ideals of bipartite graphs, and the weaker Taylor bound conjecture for all quadratic…
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…
A matroid is supersolvable if it has a maximal chain of flats each of which is modular. A matroid is saturated if every round flat is modular. In this article we present supersolvable saturated matroids as analogues to chordal graphs, and…
In this article, we study algebraic properties of binomial edge ideals of Levi graphs associated with certain plane curve arrangements. Using combinatorial properties of Levi graphs, we discuss the Cohen-Macaulayness of binomial edge ideals…