On Nontrivial Weak Dicomplementations and the Lattice Congruences that Preserve Them

2019/09/30 by Léonard Kwuida, Kwuida, Leonard, Claudia Mureșan +1 · 1 citation
Computer Science · Decision Sciences · #06B10 #06F99 #Advanced Algebra and Logic #FOS: Mathematics #Multi-Criteria Decision Making #Rings and Algebras (math.RA) #Rough Sets and Fuzzy Logic

paper · pdf · doi:10.48550/arxiv.1909.13419

openalex publication_date 2019/09/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study the existence of nontrivial and of representable (dual) weak complementations, along with the lattice congruences that preserve them, in different constructions of bounded lattices, then use this study to determine the finite (dual) weakly complemented lattices with the largest numbers of congruences, along with the structures of their congruence lattices. It turns out that, if n≥ 7 is a natural number, then the four largest numbers of congruences of the n--element (dual) weakly complemented lattices are: 2^n-2+1, 2^n-3+1, 5⋅ 2^n-6+1 and 2^n-4+1. For smaller numbers of elements, several intermediate numbers of congruences appear between the elements of this sequence. After determining these numbers, along with the structures of the (dual) weakly complemented lattices having these numbers of congruences, we derive a similar result for weakly dicomplemented lattices.

Cited by

• Filters and congruences in weakly complemented lattices

Related

• Some Extremal Values of the Number of Congruences of a Finite Lattice
• A note on finite lattices with many congruences
• Filters and congruences in weakly complemented lattices
• Balanced d-lattices are complemented
• Some Properties of Lattice Congruences Preserving Involutions and Their\n Largest Numbers in the Finite Case