Papers
Topics
Authors
Recent
Search
2000 character limit reached

Branching Rules for Koornwinder Polynomials with One Column Diagrams and Matrix Inversions

Published 6 Feb 2020 in math.QA and math.CO | (2002.02148v3)

Abstract: We present an explicit formula for the transition matrix $\mathcal{C}$ from the type $BC_n$ Koornwinder polynomials $P_{(1r)}(x|a,b,c,d|q,t)$ with one column diagrams, to the type $BC_n$ monomial symmetric polynomials $m_{(1{r})}(x)$. The entries of the matrix $\mathcal{C}$ enjoy a set of four terms recursion relations. These recursions provide us with the branching rules for the Koornwinder polynomials with one column diagrams, namely the restriction rules from $BC_n$ to $BC_{n-1}$. To have a good description of the transition matrices involved, we introduce the following degeneration scheme of the Koornwinder polynomials: $P_{(1r)}(x|a,b,c,d|q,t) \longleftrightarrow P_{(1r)}(x|a,-a,c,d|q,t)\longleftrightarrow P_{(1r)}(x|a,-a,c,-c|q,t) \longleftrightarrow P_{(1r)}\big(x|t{1/2}c,-t{1/2}c,c,-c|q,t\big) \longleftrightarrow P_{(1r)}\big(x|t{1/2},-t{1/2},1,-1|q,t\big)$. We prove that the transition matrices associated with each of these degeneration steps are given in terms of the matrix inversion formula of Bressoud. As an application, we give an explicit formula for the Kostka polynomials of type $B_n$, namely the transition matrix from the Schur polynomials $P{(B_n,B_n)}_{(1r)}(x|q;q,q)$ to the Hall-Littlewood polynomials $P{(B_n,B_n)}_{(1r)}(x|t;0,t)$. We also present a conjecture for the asymptotically free eigenfunctions of the $B_n$ $q$-Toda operator, which can be regarded as a branching formula from the $B_n$ $q$-Toda eigenfunction restricted to the $A_{n-1}$ $q$-Toda eigenfunctions.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.