Forbidden configurations for distributive and modular ordered sets
Let A be an ordered set, \(a,b\in A\). Denote by L(a,b) (U(a,b)) the set of all lower (upper, respectively) bounds of a, b. A is called distributive whenever \(L(U(a,b),c)=L(U(L(a,c),L(b,c))\) for all a,b,c\(\in A\). A is called modular if \(a\leq c\) implies \(L(U(a,b),c)=L(U(a,L(b,c)))\) for all a,b,c\(\in A\). It is clear that every distributive ordered set is modular and, moreover, if A is a lattice, then it is modular (distributive) iff it is modular (distributive, respectively) as an ordered set. The authors study the natural question whether modular ordered sets and distributive ordered sets can be characterized by some ``forbidden configurations'' similarly as in the case of lattices. The paper presents such configurations in the form of so-called strong subsets and LU subsets.
scientific article; zbMATH DE number 4103138