Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.04146 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916926535499776 |
|---|---|
| author | Adaricheva, Kira Vilmin, Simon |
| author_facet | Adaricheva, Kira Vilmin, Simon |
| contents | Implicational bases are a well-known representation of closure spaces and their closure lattices. This representation is not unique, though, and a closure space usually admits multiple bases. Among these, the canonical base, the canonical direct base as well as the $D$-base aroused significant attention due to their structural and algorithmic properties. Recently, a new base has emerged from the study of free lattices: the $E$-base. It is a refinement of the $D$-base that, unlike the aforementioned implicational bases, does not always accurately represent its associated closure space. This leads to an intriguing question: for which classes of (closure) lattices do closure spaces have valid $E$-base? Lower-bounded lattices are known to form such a class. In this paper, we prove that for semidistributive lattices, the $E$-base is both valid and minimum. We also characterize those modular and geometric lattices that have valid $E$-base. Finally, we prove that any lattice is a sublattice of a lattice with valid $E$-base. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_04146 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the $E$-base of Finite Lattices: Semidistributive, Modular, and Geometric Lattices Adaricheva, Kira Vilmin, Simon Combinatorics Discrete Mathematics Implicational bases are a well-known representation of closure spaces and their closure lattices. This representation is not unique, though, and a closure space usually admits multiple bases. Among these, the canonical base, the canonical direct base as well as the $D$-base aroused significant attention due to their structural and algorithmic properties. Recently, a new base has emerged from the study of free lattices: the $E$-base. It is a refinement of the $D$-base that, unlike the aforementioned implicational bases, does not always accurately represent its associated closure space. This leads to an intriguing question: for which classes of (closure) lattices do closure spaces have valid $E$-base? Lower-bounded lattices are known to form such a class. In this paper, we prove that for semidistributive lattices, the $E$-base is both valid and minimum. We also characterize those modular and geometric lattices that have valid $E$-base. Finally, we prove that any lattice is a sublattice of a lattice with valid $E$-base. |
| title | On the $E$-base of Finite Lattices: Semidistributive, Modular, and Geometric Lattices |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2502.04146 |