A representation-theoretic proof of the branching rule for Macdonald polynomial

zbMATH Open1335.05204MaRDI QIDQ2803352

Yi Sun

Publication date: 4 May 2016

zbMATH Keywords

quantum groupsMacdonald polynomialsdouble affine Hecke algebrasGelfand-Tsetlin basis

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Quantum groups (quantized enveloping algebras) and related deformations (17B37) Hecke algebras and their representations (20C08) Basic orthogonal polynomials and functions (Askey-Wilson polynomials, etc.) (33D45)

Related Items (2)

Proof of an algorithm for the evaluation of the branching multiplicity SO(2n)→SO(2n−2)⊗U(1) ⋮ A representation-theoretic proof of the branching rule for Macdonald polynomials

Recommendations

• Title not available (Why is that?) 👍 👎
• On a bijective proof of a factorization formula for Macdonald polynomials 👍 👎
• A new recursion in the theory of Macdonald polynomials 👍 👎
• A new generalisation of Macdonald polynomials 👍 👎
• A representation-theoretic proof of the branching rule for Macdonald polynomials 👍 👎
• Branching formula for Macdonald-Koornwinder polynomials 👍 👎
• On the connection between Macdonald polynomials and Demazure characters 👍 👎
• A bijective proof of a factorization formula for specialized Macdonald polynomials 👍 👎
• A bijective proof of a factorization formula for Macdonald polynomials at roots of unity 👍 👎
• Combinatorial theory of Macdonald polynomials I: Proof of Haglund's formula 👍 👎

This page was built for publication: A representation-theoretic proof of the branching rule for Macdonald polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803352)