English

Type A Partially-Symmetric Macdonald Polynomials

Combinatorics 2023-12-20 v3

Abstract

We construct type A partially-symmetric Macdonald polynomials P(λγ)P_{(\lambda \mid \gamma)}, where λZ0nk\lambda \in \mathbb{Z}_{\geq 0}^{n-k} is a partition and γZ0k\gamma \in \mathbb{Z}_{\geq 0}^k is a composition. These are polynomials which are symmetric in the first nkn-k variables, but not necessarily in the final kk variables. We establish their stability and an integral form defined using Young diagram statistics. Finally, we build Pieri-type rules for degree 1 products xjP(λγ)x_j P_{(\lambda \mid \gamma)} for j>nkj > n-k and e1[x1,,xnk]P(λγ)e_1[x_1, \dotsc, x_{n-k}] P_{(\lambda \mid \gamma)}, along with substantial combinatorial simplification of the e1e_1 multiplication. The P(λγ)P_{(\lambda \mid \gamma)} are the same as the mm-symmetric Macdonald polynomials defined by Lapointe up to a change of variables.

Keywords

Cite

@article{arxiv.2311.12216,
  title  = {Type A Partially-Symmetric Macdonald Polynomials},
  author = {Ben Goodberry},
  journal= {arXiv preprint arXiv:2311.12216},
  year   = {2023}
}

Comments

49 pages, 2 figures

R2 v1 2026-06-28T13:26:46.496Z