Combinatorics of the Delta conjecture at q=-1
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913287185104896 |
|---|---|
| author | Corteel, Sylvie Josuat-Vergès, Matthieu Wyngaerd, Anna Vanden |
| author_facet | Corteel, Sylvie Josuat-Vergès, Matthieu Wyngaerd, Anna Vanden |
| contents | In the context of the shuffle theorem, many classical integer sequences appear with a natural refinement by two statistics $q$ and $t$: for example the Catalan and Schröder numbers. In particular, the bigraded Hilbert series of diagonal harmonics is a $q,t$-analog of $(n+1)^{n-1}$ (and can be written in terms of symmetric functions via the nabla operator). The motivation for this work is the observation that at $q=-1$, this $q,t$-analog becomes a $t$-analog of Euler numbers, a famous integer sequence that counts alternating permutations. We prove this observation via a more general statement, that involves the Delta operator on symmetric functions (on one side), and new combinatorial statistics on permutations involving peaks and valleys (on the other side). An important tool are the schedule numbers of a parking function first introduced by Hicks; and expanded upon by Haglund and Sergel. Other empirical observation suggest that nonnegativity at $q=-1$ holds in far greater generality. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_04136 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Combinatorics of the Delta conjecture at q=-1 Corteel, Sylvie Josuat-Vergès, Matthieu Wyngaerd, Anna Vanden Combinatorics In the context of the shuffle theorem, many classical integer sequences appear with a natural refinement by two statistics $q$ and $t$: for example the Catalan and Schröder numbers. In particular, the bigraded Hilbert series of diagonal harmonics is a $q,t$-analog of $(n+1)^{n-1}$ (and can be written in terms of symmetric functions via the nabla operator). The motivation for this work is the observation that at $q=-1$, this $q,t$-analog becomes a $t$-analog of Euler numbers, a famous integer sequence that counts alternating permutations. We prove this observation via a more general statement, that involves the Delta operator on symmetric functions (on one side), and new combinatorial statistics on permutations involving peaks and valleys (on the other side). An important tool are the schedule numbers of a parking function first introduced by Hicks; and expanded upon by Haglund and Sergel. Other empirical observation suggest that nonnegativity at $q=-1$ holds in far greater generality. |
| title | Combinatorics of the Delta conjecture at q=-1 |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2302.04136 |