Primes, irreducibles and extremal lattices (Q1207723): Difference between revisions

An element \(a\) of a \((\neq 1)\) lattice \(L\) is called prime if for all \(x,y\), \(x\wedge y\leq a\) implies that \(x\leq a\) or \(y\leq a\). The coprime element is defined dually. The author uses these elements to characterize some types of lattices, e.g. the meet-pseudocomplemented lattices. The author considers lattices with length equal to the join-rank, or meet- rank; these are \(p\)-extremal lattices. Many interesting properties of \(p\)-extremal lattices are proved.