Cohen-Macaulay chordal graphs
We classify all Cohen-Macaulay chordal graphs. In particular. it is shown that a chordal graph is Cohen-Macaulay if and only if its unmixed.
arXiv subjects
Publications and source records attributed to Takayuki Hibi.
We classify all Cohen-Macaulay chordal graphs. In particular. it is shown that a chordal graph is Cohen-Macaulay if and only if its unmixed.
Squarefree monomial ideals arising from finite meet-semilattices and their free resolutions are studied. For the squarefree monomial ideals corresponding to poset ideals in a distributive lattice the Alexander dual is computed.
The Alexander dual of an arbitrary meet-semilattice is described explicitly. Meet-distributive meet-semilattices whose Alexander dual is level are characterized.
A certain squarefree monomial ideal $H_P$ arising from a finite partially ordered set $P$ will be studied from viewpoints of both commutative algebra and combinatorics. First, it is proved that the defining ideal of the Rees algebra of $H_P$ possesses a quadratic Gröbner basis. Thus in particular all powers of $H_P$ have linear resolutions. Second, the minimal free graded resolution of $H_P$ will be constructed explicitly and a combinatorial formula to compute the Betti numbers of $H_P$ will be presented. Third, by using the fact that the Alexander dual of the simplicial complex $Δ$ whose Stanley--Reisner ideal coincides with $H_P$ is Cohen--Macaulay, all the Cohen--Macaulay bipartite graphs will be classified.
The discrete polymatroid is a multiset analogue of the matroid. Based on the polyhedral theory on integral polymatroids developed in late 1960's and in early 1970's, in the present paper the combinatorics and algebra on discrete polymatroids will be studied.
In this paper we consider graded ideals in a polynomial ring over a field and ask when such an ideal has the property that all of its powers have a linear resolution. In particular it is shown that all powers of a monomial ideal with 2-linear resolution have again a linear resolution.
By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac's theorem on chordal graphs.
In the first part of the paper we answer (positively) a question raised by the first author which has to do with some sort of rigity of the tail of resolution of an ideal. Let $I$ be a homogeneous ideal in a polynomial ring over a field of characteristic 0. Denote by $β_i(I)$ the $i$-th Betti number of $I$ and by $Gin(I)$ the revlex generic initial ideal of $I$. In general one has $β_i(I)\leq β_i(Gin(I))$ and we show that if $β_i(I)=β_i(Gin(I))$ for some $i$ then $β_j(I)=β_j(Gin(I))$ for all $j>i$. In the second part of the paper we answer a question of Eisenbud and Huneke. We prove that if $I$ is $m$-primary and $I\subset m^d$ then $β_i(m^d)\leq β_i(Gin(I))$ for all $i$.