English

Bounded Littlewood identities

Combinatorics 2021-05-19 v3 Number Theory Representation Theory

Abstract

We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of bounded Littlewood identities for Macdonald polynomials. These identities, which take the form of decomposition formulas for Macdonald polynomials of type (R,S)(R,S) in terms of ordinary Macdonald polynomials, are q,tq,t-analogues of known branching formulas for characters of the symplectic, orthogonal and special orthogonal groups. In the classical limit, our method implies that MacMahon's famous ex-conjecture for the generating function of symmetric plane partitions in a box follows from the identification of (GL(n,R),O(n))(\mathrm{GL}(n,\mathbb{R}),\mathrm{O}(n)) as a Gelfand pair. As further applications, we obtain combinatorial formulas for characters of affine Lie algebras; Rogers-Ramanujan identities for affine Lie algebras, complementing recent results of Griffin et al.; and quadratic transformation formulas for Kaneko--Macdonald-type basic hypergeometric series.

Keywords

Cite

@article{arxiv.1506.02755,
  title  = {Bounded Littlewood identities},
  author = {Eric M. Rains and S. Ole Warnaar},
  journal= {arXiv preprint arXiv:1506.02755},
  year   = {2021}
}

Comments

114 pages; Expanded version to appear in Memoirs of the AMS. New material includes: (1) a discussion of symmetric plane partitions and Gelfand pairs (2) formulas for multiple basic hypergeometric series (3) new open problems including a (conjectural) connection between bounded Littlewood identities and q,t-Littlewood-Richardson coefficients, (4) An appendix on limits of elliptic beta integrals

R2 v1 2026-06-22T09:49:48.777Z