Distributive Lattices, Bipartite Graphs and Alexander Duality
交换代数
2007-05-23 v1 组合数学
摘要
A certain squarefree monomial ideal arising from a finite partially ordered set will be studied from viewpoints of both commutative algebra and combinatorics. First, it is proved that the defining ideal of the Rees algebra of possesses a quadratic Gr\"obner basis. Thus in particular all powers of have linear resolutions. Second, the minimal free graded resolution of will be constructed explicitly and a combinatorial formula to compute the Betti numbers of will be presented. Third, by using the fact that the Alexander dual of the simplicial complex whose Stanley--Reisner ideal coincides with is Cohen--Macaulay, all the Cohen--Macaulay bipartite graphs will be classified.
引用
@article{arxiv.math/0307235,
title = {Distributive Lattices, Bipartite Graphs and Alexander Duality},
author = {Juergen Herzog and Takayuki Hibi},
journal= {arXiv preprint arXiv:math/0307235},
year = {2007}
}