Metraipolis › archive › dc_5ea7212e3436
The lattice of antichains of intervals: Dyck paths, level sets, and sweep dimension — arXiv:2610.41385
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41385
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T08:18:35.682Z
- SHA-256 of the archived text
dbba2ad81b033fa59163f1bc236aafdfb1fd0daa8a73437593d6fb67f2fe67f3- Stable URL of this page
https://metraipolis.com/documento/dc_5ea7212e3436
How to cite
The lattice of antichains of intervals: Dyck paths, level sets, and sweep dimension — arXiv:2610.41385 — arXiv (en), https://arxiv.org/abs/2610.41385 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5ea7212e3436 (Metraipolis archive dc_5ea7212e3436, sha256 dbba2ad81b033fa59163f1bc236aafdfb1fd0daa8a73437593d6fb67f2fe67f3)
BibTeX
@misc{dc5ea7212e3436,
title = {The lattice of antichains of intervals: Dyck paths, level sets, and sweep dimension — arXiv:2610.41385},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41385},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5ea7212e3436; sha256 dbba2ad81b033fa59163f1bc236aafdfb1fd0daa8a73437593d6fb67f2fe67f3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41385. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Clarke-Cormack-Burkowski lattice $\mathcal{E}_n$ is the lattice of antichains of intervals of the chain $\{0,1,\dots,n-1\}$, the algebraic structure underlying minimal-interval semantics, a query semantics used in information retrieval. We give an explicit, elementary anti-isomorphism between $\mathcal{E}_n$ minus its top element and the Stanley lattice of Dyck words of semilength $n+1$ (an anti-isomorphism whose existence is implicit in work of Ferrari and Munarini), under which the rank of an antichain is $\binom{n+1}{2}$ minus the area of the associated Dyck word. Hence the rank generating function of $\mathcal{E}_n\setminus\{\top\}$ is the reverse of the Carlitz-Riordan $q$-Catalan polynomial. Using a local limit theorem for the area of random-walk excursions, we confirm unconditionally an asymptotic formula of Takács: the size $\lambda_n$ of the largest level set of $\mathcal{E}_n$ satisfies $\lambda_n\sim\kappa\,4^{n+1}/(n+1)^3$, where $\kappa\approx1.0807$. Finally, for the antichains of intervals of an arbitrary finite poset $P$ we study the sweep dimension, the minimum number of linear orders needed to separate every interval from every element outside it. It equals the Dushnik-Miller dimension of the lattice of convex subsets of $P$, it is the least $k$ for which $P$ maps into $\mathbb{R}^k$ so that every interval is the preimage of an upper orthant, and it lies between $\max(2,w)$ and $2w$, where $w$ is the width of $P$, both bounds being tight. Antichains of intervals embed, preserving joins, into $k$-dimensional staircase regions.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2610.41385 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T08:05:23.777Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).