Branching formula for Macdonald-Koornwinder polynomials (Q745171)

The review follows the introduction of the paper. Branching formulas constitute a powerful tool in algebraic combinatorics which provides a recursive scheme to build symmetric polynomials via induction in the number of variables. The combinatorial aspects of the hyperoctahedral-symmetric Macdonald-Koornwinder polynomials were explored in seminal works of Okounkov and Rains. In particular, the structure of a branching formula for the Macdonald-Koornwinder polynomials has been outlined by them. The aim of the present note is to make the branching polynomials under consideration explicit. The main tools the authors use to achieve this goal consists in: Mimachi's Cauchy formula for the Macdonald-Koornwinder polynomials (a special `column-row' case of), the Cauchy formula for Okounkov's hyperoctahedral interpolation polynomials and explicitly known Pieri coefficients for the Macdonald-Koornwinder polynomials. After recalling some necessary preliminaries regarding the Macdonald-Koornwinder polynomials and their Pieri formulas in Section 2, the authors state in Section 3 the branching formula and prove it in Section 4.