English

Multi-Macdonald polynomials

Combinatorics 2019-09-23 v1 Representation Theory

Abstract

We introduce Macdonald polynomials indexed by nn-tuples of partitions and characterized by certain orthogonality and triangularity relations. We prove that they can be explicitly given as products of ordinary Macdonald polynomials depending on special alphabets. With this factorization in hand, we establish their most basic properties, such as explicit formulas for their norm-squared, evaluation and reproducing kernel. Moreover, we show that the q,tq,t-Kostka coefficients associated to the multi-Macdonald polynomials are positive and correspond to q,tq,t-analogs of the dimensions of the irreducible representations of CnSdC_n \sim S_d, the wreath product of the cyclic group CnC_n with the symmetric group.

Keywords

Cite

@article{arxiv.1909.09354,
  title  = {Multi-Macdonald polynomials},
  author = {Camilo González and Luc Lapointe},
  journal= {arXiv preprint arXiv:1909.09354},
  year   = {2019}
}