Meet-distributive lattices and the anti-exchange closure
- 115 Downloads
This paper defines the anti-exchange closure, a generalization of the order ideals of a partially ordered set. Various theorems are proved about this closure. The main theorem presented is that a latticeL is the lattice of closed sets of an anti-exchange closure if and only if it is a meet-distributive lattice. This result is used to give a combinatorial interpretation of the zetapolynomial of a meet-distributive lattice.
KeywordsBoolean Algebra Distributive Lattice Algebra UNIV Order Ideal Boolean Lattice
Unable to display preview. Download preview PDF.
- G. Birkhoff,Lattice Theory, 3rd. ed., American Math. Soc., Providence, 1967.Google Scholar
- C. Greene andG. Markowsky,A combinatorial test for local distributivity, I.B.M. Technical Report No. RC5129 (November, 1974).Google Scholar
- R. P. Stanley,Ordered structures and partitions, Mem. Amer. Math. Soc., No. 119, Amer. Math. Soc., Providence, 1972.Google Scholar