Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2407.17660 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915458345598976 |
|---|---|
| author | Ebrahimi-Fard, Kurusch Foissy, Loïc Kock, Joachim Patras, Frédéric |
| author_facet | Ebrahimi-Fard, Kurusch Foissy, Loïc Kock, Joachim Patras, Frédéric |
| contents | Higher-order notions of Kreweras complementation have appeared in the literature in the works of Krawczyk, Speicher, Mastnak, Nica, Arizmendi, Vargas, and others. While the theory has been developed primarily for specific applications in free probability, it also possesses an elegant, purely combinatorial core that is of independent interest. The present article aims at offering a simple account of various aspects of higher-order Kreweras complementation on the basis of elementary arithmetic, (co)algebraic, categorical and simplicial properties of noncrossing partitions. The main idea is to consider noncrossing partitions as providing an interesting noncommutative analogue of the interplay between the divisibility poset and the multiplicative monoid of positive integers. Just as the divisibility poset can be regarded as the decalage of the multiplicative monoid, we exhibit the lattice of noncrossing partitions as the decalage of a partial monoid structure on noncrossing partitions encoding higher-order Kreweras complements. While our results may be considered familiar, several of the viewpoints can be regarded as novel, offering an efficient approach both conceptually and computationally. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_17660 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Noncrossing arithmetic Ebrahimi-Fard, Kurusch Foissy, Loïc Kock, Joachim Patras, Frédéric Combinatorics 05A18, 46L54, 11A05, 06A11, 18N50 Higher-order notions of Kreweras complementation have appeared in the literature in the works of Krawczyk, Speicher, Mastnak, Nica, Arizmendi, Vargas, and others. While the theory has been developed primarily for specific applications in free probability, it also possesses an elegant, purely combinatorial core that is of independent interest. The present article aims at offering a simple account of various aspects of higher-order Kreweras complementation on the basis of elementary arithmetic, (co)algebraic, categorical and simplicial properties of noncrossing partitions. The main idea is to consider noncrossing partitions as providing an interesting noncommutative analogue of the interplay between the divisibility poset and the multiplicative monoid of positive integers. Just as the divisibility poset can be regarded as the decalage of the multiplicative monoid, we exhibit the lattice of noncrossing partitions as the decalage of a partial monoid structure on noncrossing partitions encoding higher-order Kreweras complements. While our results may be considered familiar, several of the viewpoints can be regarded as novel, offering an efficient approach both conceptually and computationally. |
| title | Noncrossing arithmetic |
| topic | Combinatorics 05A18, 46L54, 11A05, 06A11, 18N50 |
| url | https://arxiv.org/abs/2407.17660 |