Covering Distributive Lattices by Intervals
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913214731649024 |
|---|---|
| author | Duffus, Dwight Sands, Bill |
| author_facet | Duffus, Dwight Sands, Bill |
| contents | We consider the convex subset $[A,B]$ of all elements between two levels $A$ and $B$ of a finite distributive lattice, as a union of (or covered by) intervals $[a,b]$. A 1988 result of Voigt and Wegener shows that for such convex subsets of finite Boolean lattices, covers using $\max(|A|,|B|)$ intervals (the minimum possible number) exist. In 1992 Bouchemakh and Engel pointed out that this result holds more generally for finite products of finite chains. In this paper we show that covers of size $\max(|A|,|B|)$ exist for $[A,B]$ when $A$ is the set of atoms and $B$ the set of coatoms of any finite distributive lattice. This is a consequence of a more general result for finite partially ordered sets. We also speculate on the situation when other levels of finite distributive lattices are considered, and prove a couple of theorems supporting these speculations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_15718 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Covering Distributive Lattices by Intervals Duffus, Dwight Sands, Bill Combinatorics 06A07, 06D05 We consider the convex subset $[A,B]$ of all elements between two levels $A$ and $B$ of a finite distributive lattice, as a union of (or covered by) intervals $[a,b]$. A 1988 result of Voigt and Wegener shows that for such convex subsets of finite Boolean lattices, covers using $\max(|A|,|B|)$ intervals (the minimum possible number) exist. In 1992 Bouchemakh and Engel pointed out that this result holds more generally for finite products of finite chains. In this paper we show that covers of size $\max(|A|,|B|)$ exist for $[A,B]$ when $A$ is the set of atoms and $B$ the set of coatoms of any finite distributive lattice. This is a consequence of a more general result for finite partially ordered sets. We also speculate on the situation when other levels of finite distributive lattices are considered, and prove a couple of theorems supporting these speculations. |
| title | Covering Distributive Lattices by Intervals |
| topic | Combinatorics 06A07, 06D05 |
| url | https://arxiv.org/abs/2401.15718 |