2022/08/07 by Gábor Czédli, Czédli, Gábor
Computer Science · #06C10 #Advanced Algebra and Logic #Authorship Attribution and Profiling #FOS: Mathematics #Rings and Algebras (math.RA) #Rough Sets and Fuzzy Logic
paper · pdf · doi:10.48550/arxiv.2208.03606
openalex publication_date 2022/08/07 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28
Slim semimodular lattices (for short, SPS lattices) and slim rectangular lattices (for short, SR lattices) were introduced by G. Grätzer and E. Knapp in 2007 and 2009. These lattices are necessarily finite and planar, and they have been studied in more then four dozen papers since 2007. They are best understood with the help of their \mathcal C1-diagrams, introduced by the author in 2017. For a diagram F of a finite lattice L and a congruence α of L, we define the ``quotient diagram'' F/α by taking the maximal elements of the α-blocks and preserving their geometric positions. While F/α is not even a Hasse diagram in general, we prove that whenever L is an SR lattice and F is a \mathcal C1-diagram of L, then F/α is a \mathcal C1-diagram of L/α, which is an SR lattice or a chain. The class of lattices isomorphic to the congruence lattices of SPS lattices is closed under taking filters. We prove that this class is closed under two more constructions, which are inverses of taking filters in some sense; one of the two respective proofs relies on an inverse of the quotient diagram construction.