- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Kostka--Foulkes polynomials at $q = -1$
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Kostka--Foulkes polynomials at $q = -1$ Frieden, Gabriel
Description
The Kostka--Foulkes polynomials, $K_{\lambda, \mu}(q)$, arise in many contexts in combinatorics and representation theory. Lascoux and Schutzenberger showed that they are generating functions over $\text{SSYT}(\lambda, \mu)$ (the set of semistandard Young tableaux of shape $\lambda$ and content $\mu$) with respect to a statistic called charge. In particular, they evaluate to the familiar Kostka number at $q = 1$. One might hope that the evaluation at $q = -1$ counts the number of fixed points of a natural involution on $\text{SSYT}(\lambda, \mu)$. When the content $\mu$ is palindromic (for instance, in the case of standard tableau) it follows from work of Stembridge and Lascoux--Leclerc--Thibon that $K_{\lambda, \mu}(-1)$ is equal, up to sign, to the number of elements of $\text{SSYT}(\lambda, \mu)$ that are fixed by evacuation (the Schutzenberger involution). This restriction on $\mu$ is necessary because evacuation is content-reversing. In recent joint work with Mike Chmutov, Dongkwan Kim, Joel Lewis, and Elena Yudovina, we showed that in general, $K_{\lambda, \mu}(-1)$ counts, up to sign, the number of fixed points of the involution obtained by composing evacuation with the action of the long element $w_0$ by the Lascoux--Schutzenberger (or crystal) symmetric group action on tableaux. When the content is palindromic, the action of $w_0$ is trivial, so our result reduces to the above-mentioned one. The proof relies on the theory of rigged configurations.
Item Metadata
Title |
Kostka--Foulkes polynomials at $q = -1$
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2019-01-23T09:05
|
Description |
The Kostka--Foulkes polynomials, $K_{\lambda, \mu}(q)$, arise in many contexts in combinatorics and representation theory. Lascoux and Schutzenberger showed that they are generating functions over $\text{SSYT}(\lambda, \mu)$ (the set of semistandard Young tableaux of shape $\lambda$ and content $\mu$) with respect to a statistic called charge. In particular, they evaluate to the familiar Kostka number at $q = 1$. One might hope that the evaluation at $q = -1$ counts the number of fixed points of a natural involution on $\text{SSYT}(\lambda, \mu)$.
When the content $\mu$ is palindromic (for instance, in the case of standard tableau) it follows from work of Stembridge and Lascoux--Leclerc--Thibon that $K_{\lambda, \mu}(-1)$ is equal, up to sign, to the number of elements of $\text{SSYT}(\lambda, \mu)$ that are fixed by evacuation (the Schutzenberger involution). This restriction on $\mu$ is necessary because evacuation is content-reversing.
In recent joint work with Mike Chmutov, Dongkwan Kim, Joel Lewis, and Elena Yudovina, we showed that in general, $K_{\lambda, \mu}(-1)$ counts, up to sign, the number of fixed points of the involution obtained by composing evacuation with the action of the long element $w_0$ by the Lascoux--Schutzenberger (or crystal) symmetric group action on tableaux. When the content is palindromic, the action of $w_0$ is trivial, so our result reduces to the above-mentioned one. The proof relies on the theory of rigged configurations.
|
Extent |
49.0
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: Université du Québec à Montréal
|
Series | |
Date Available |
2019-07-23
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0379941
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Postdoctoral
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International