Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Macdonald Polynomials and level two Demazure modules for affine $\mathfrak{sl}_{n+1}$ (1910.05848v2)

Published 13 Oct 2019 in math.RT, math.CO, and math.QA

Abstract: We define a family of symmetric polynomials $G_{\nu,\lambda}(z_1,\cdots, z_{n+1},q)$ indexed by a pair of dominant integral weights. The polynomial $G_{\nu,0}(z,q)$ is the specialized Macdonald polynomial and we prove that $G_{0,\lambda}(z,q)$ is the graded character of a level two Demazure module associated to the affine Lie algebra $\widehat{\mathfrak{sl}}{n+1}$. Under suitable conditions on $(\nu,\lambda)$ (which includes the case when $\nu=0$ or $\lambda=0$) we prove that $G{\nu,\lambda}(z,q)$ is Schur positive and give explicit formulae for them in terms of Macdonald polynomials.

Summary

We haven't generated a summary for this paper yet.