A bijection between edges of the Turán graph and irreducible elements in the dominance order lattice
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910003397394432 |
|---|---|
| author | Hassler, Nathanaël |
| author_facet | Hassler, Nathanaël |
| contents | In this paper we build a bijection between the meet-irreducible elements of the lattice of the compositions of $n$ with parts in $[1,p]$ equipped with the dominance order, and the edges of the $(n,p)$-Turán graph. Using this bijection, we then compute asymptotically the average value of some statistics on those meet-irreducible compositions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_20590 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A bijection between edges of the Turán graph and irreducible elements in the dominance order lattice Hassler, Nathanaël Combinatorics In this paper we build a bijection between the meet-irreducible elements of the lattice of the compositions of $n$ with parts in $[1,p]$ equipped with the dominance order, and the edges of the $(n,p)$-Turán graph. Using this bijection, we then compute asymptotically the average value of some statistics on those meet-irreducible compositions. |
| title | A bijection between edges of the Turán graph and irreducible elements in the dominance order lattice |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2601.20590 |