A Dynkin diagram classification theorem arising from a combinatorial problem

AbstractA combinatorial-linear algebraic condition sufficient for a ranked partially ordered set to be rank unimodal and strongly Sperner is presented. The distributive lattices which satisfy this condition are classified. These lattices are indexed by Dynkin diagrams of type ADE, which actually appear embedded in the Hasse diagrams of the lattices