Distributive Lattices, Bipartite Graphs and Alexander Duality

Abstract

A certain squarefree monomial ideal HP 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 HP possesses a quadratic Gr\"obner basis. Thus in particular all powers of HP have linear resolutions. Second, the minimal free graded resolution of HP will be constructed explicitly and a combinatorial formula to compute the Betti numbers of HP will be presented. Third, by using the fact that the Alexander dual of the simplicial complex whose Stanley--Reisner ideal coincides with HP is Cohen--Macaulay, all the Cohen--Macaulay bipartite graphs will be classified.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…