Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals
147
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let C be a uniform clutter and let I=I(C) be its edge ideal. We prove that if C satisfies the packing property (resp. max-flow min-cut property), then there is a uniform Cohen-Macaulay clutter C1 satisfying the packing property (resp. max-flow min-cut property) such that C is a minor of C1. For arbitrary edge ideals of clutters we prove that the normality property is closed under parallelizations. Then we show some applications to edge ideals and clutters which are related to a conjecture of Conforti and Cornuejols and to max-flow min-cut problems.
rate research
Read More
We characterize unmixed and Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs. We also provide examples of oriented graphs which have unmixed and non-Cohen-Macaulay vertex-weighted edge ideals, while the edge ideal of their underlying graph is Cohen-Macaulay. This disproves a conjecture posed by Pitones, Reyes and Toledo.
Scattered over the past few years have been several occurrences of simplicial complexes whose topological behavior characterize the Cohen-Macaulay property for quotients of polynomial rings by arbitrary (not necessarily squarefree) monomial ideals. The purpose of this survey is to gather the developments into one location, with self-contained proofs, including direct combinatorial topological connections between them.
Let C be a uniform clutter, i.e., all the edges of C have the same size, and let A be the incidence matrix of C. We denote the column vectors of A by v1,...,vq. The vertex covering number of C, denoted by g, is the smallest number of vertices in any minimal vertex cover of C. Under certain conditions we prove that C is vertex critical. If C satisfies the max-flow min-cut property, we prove that A diagonalizes over the integers to an identity matrix and that v1,...,vq is a Hilbert basis. It is shown that if C has a perfect matching such that C has the packing property and g=2, then A diagonalizes over the integers to an identity matrix. If A is a balanced matrix we prove that any regular triangulation of the cone generated by v1,...,vq is unimodular. Some examples are presented to show that our results only hold for uniform clutters. These results are closely related to certain algebraic properties, such as the normality or torsion freeness, of blowup algebras of edge ideals and to finitely generated abelian groups. They are also related to the theory of Grobner bases of toric ideals and to Ehrhart rings.
Let $I(G)$ be the edge ideal of a simple graph $G$. In this paper, we will give sufficient and necessary combinatorial conditions of $G$ in which the second symbolic and ordinary power of its edge ideal are Cohen-Macaulay (resp. Buchsbaum, generalized Cohen-Macaulay). As an application of our results, we will classify all bipartite graphs in which the second (symbolic) powers are Cohen-Macaulay (resp. Buchsbaum, generalized Cohen-Macaulay).
For a partition $lambda$ of $n in {mathbb N}$, let $I^{rm Sp}_lambda$ be the ideal of $R=K[x_1,ldots,x_n]$ generated by all Specht polynomials of shape $lambda$. In the previous paper, the second author showed that if $R/I^{rm Sp}_lambda$ is Cohen-Macaulay, then $lambda$ is either $(n-d,1,ldots,1),(n-d,d)$, or $(d,d,1)$, and the converse is true if ${rm char}(K)=0$. In this paper, we compute the Hilbert series of $R/I^{rm Sp}_lambda$ for $lambda=(n-d,d)$ or $(d,d,1)$. Hence, we get the Castelnuovo-Mumford regularity of $R/I^{rm Sp}_lambda$, when it is Cohen-Macaulay. In particular, $I^{rm Sp}_{(d,d,1)}$ has a $(d+2)$-linear resolution in the Cohen-Macaulay case.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
