The lattice of antichain cutsets of a partially ordered set
The author proves that if (X,\(\leq)\) is a finite partially ordered set then there exists a finite partially ordered set (Y,\(\leq)\) whose chains have at most three elements and whose lattice of antichain cutsets is isomorphic to the lattice of order ideals of (X,\(\leq)\). Using the fact that every finite distributive lattice is isomorphic to the lattice of order ideals of a finite partially ordered set, he finally gives the corollary that every finite distributive lattice is isomorphic to the lattice of antichain cutsets of a finite partially ordered set whose chains have at most three elements.
- Avoidable structures. II: Finite distributive lattices and nicely structured ordered sets
- Maximum-sized antichains in minimal posets
- Back-and-forth for systems of antichains
- Antichain cutsets of strongly connected posets
- scientific article; zbMATH DE number 458919 (Why is no real title available?)
- scientific article; zbMATH DE number 4162946 (Why is no real title available?)
- MAXIMAL ANTICHAINS AND DISSECTING IDEALS
- scientific article; zbMATH DE number 2172912 (Why is no real title available?)
- Cutsets and anti-chains in linear lattices
- Retracts of posets: The chain-gap property and the selection property are independent
This page was built for publication: The lattice of antichain cutsets of a partially ordered set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807647)