Conjecture on Maximal Sublattices of Finite Semidistributive Lattices and Beyond
Discrete Mathematics & Theoretical Computer Science · 23.07.2026 · vol. 28:2 (Combinatorics)
DOI: 10.46298/dmtcs.16374 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, online erschienen am 23.07.2026. Verfasst von K. Adaricheva und 3 weiteren Autor:innen.
Abstract (Originalsprache)
We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of semidistributive lattices is the intersection of classes of join- and meet-semidistributive lattices, we study also complements for these classes, and in particular convex geometries of convex dimension 2, which is a subclass of join-semidistributive lattices. In the latter case, we describe the complements of maximal sublattices completely, as well as the procedure of finding all complements of maximal sublattices. 21 pages, 11 figures
Zitieren
APA
Adaricheva, K., Mata, A., Silberger, S., & Zamojska-Dzienio, A. (2026). Conjecture on Maximal Sublattices of Finite Semidistributive Lattices and Beyond. Discrete Mathematics & Theoretical Computer Science, vol. 28:2(Combinatorics). https://doi.org/10.46298/dmtcs.16374
Vancouver
Adaricheva K, Mata A, Silberger S, Zamojska-Dzienio A. Conjecture on Maximal Sublattices of Finite Semidistributive Lattices and Beyond. Discrete Mathematics & Theoretical Computer Science. 2026;vol. 28:2(Combinatorics). doi:10.46298/dmtcs.16374
BibTeX
@article{Adaricheva2026,
author = {Adaricheva, K. and Mata, A. and Silberger, S. and Zamojska-Dzienio, A.},
title = {Conjecture on Maximal Sublattices of Finite Semidistributive Lattices and Beyond},
journal = {Discrete Mathematics & Theoretical Computer Science},
year = {2026},
volume = {vol. 28:2},
number = {Combinatorics},
doi = {10.46298/dmtcs.16374}
}
EUVIMED