Lower semimodular types of lattices: Frankl's conjecture holds for lower quasi-semimodular lattices (Q1972319)

A graded finite lattice \(L\) with rank function \(r\) is called lower semimodular if \(r(x\vee y)+r (x\wedge y)\geq r(x) +r(y)\) for all \(x,y\in L\). Denote by \(\eta(L)\) the minimum size of a principal filter generated by a join-irreducible element of \(L\). Frankl's Conjecture is the following statement: If a lattice \(L\) has at least two elements, then \(\eta(L)\leq|L |/2\), and moreover equality holds iff \(L\) is Boolean. It is shown that Frankl's Conjecture holds for lower semimodular lattices (Theorem 6.3). (This was also proved by \textit{J. Reinhold} [ibid. 16, No. 1, 115-116 (2000); see the review below].) The authors introduce the lower semimodular type \(\text{lt}(L)\) of a lattice \(L\). A lattice \(L\) is lower semimodular iff \(\text{lt}(L) =0\). If \(\text{lt}(L)=1\), then \(L\) is called a lower quasi-semimodular lattice. The main result (Theorem 6.5) states that Frankl's Conjecture holds also for lower quasi-semimodular lattices.