A simplicial elimination scheme for \(\wedge\)-semidistributive lattices and interval collapsing (Q2496168)

In this paper a new class of so-called simplicial lattices is introduced; it is based on some particular elimination schemes. This class is shown to be a strict generalization of the \(\wedge \)-extremal and \(\wedge \)-semidistributive lattices. It is shown that \(\wedge \)-semidistributive lattices can be characterized by a simplicial elimination scheme in the same sense as upper locally distributive lattices or antimatroids. This elimination scheme leads to an interval collapsing algorithm and a constructing algorithm for semidistributive lattices.