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

zbMATH Open1335.05204MaRDI QIDQ2803352FDOQ2803352

Authors: Yi Sun 

Publication date: 4 May 2016

Recommendations

• A representation-theoretic proof of the branching rule for Macdonald polynomials
• Branching formula for Macdonald-Koornwinder polynomials
• scientific article; zbMATH DE number 898057
• On a bijective proof of a factorization formula for Macdonald polynomials
• A bijective proof of a factorization formula for specialized Macdonald polynomials
• A new recursion in the theory of Macdonald polynomials
• Combinatorial theory of Macdonald polynomials I: Proof of Haglund's formula
• A bijective proof of a factorization formula for Macdonald polynomials at roots of unity
• On the connection between Macdonald polynomials and Demazure characters
• A new generalisation of Macdonald polynomials

zbMATH Keywords

double affine Hecke algebrasquantum groupsMacdonald polynomialsGelfand-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) Basic orthogonal polynomials and functions (Askey-Wilson polynomials, etc.) (33D45) Hecke algebras and their representations (20C08)

Cited In (4)

• An elliptic hypergeometric function approach to branching rules
• A representation-theoretic proof of the branching rule for Macdonald polynomials
• Proof of an algorithm for the evaluation of the branching multiplicity SO(2n)→SO(2n−2)⊗U(1)
• On the expansion of certain vector-valued characters of \(U_q (\mathfrak{gl}_n)\) with respect to the Gelfand-Tsetlin basis

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)