Macdonald polynomials and extended Gelfand-Tsetlin graph

Abstract

Using Okounkov's $q$-integral representation of Macdonald polynomials we construct an infinite sequence ${\Omega }_1,{\Omega }_2,{\Omega }_3,\dots$ of countable sets linked by transition probabilities from ${\Omega }_N$ to ${\Omega }_{N-1}$ for each $N=2,3,\dots$. The elements of the sets ${\Omega }_N$ are the vertices of the extended Gelfand-Tsetlin graph, and the transition probabilities depend on the two Macdonald parameters, $q$ and $t$. These data determine a family of Markov chains, and the main result is the description of their entrance boundaries. This work has its origin in asymptotic representation theory. In the subsequent paper, the main result is applied to large-$N$ limit transition in $(q,t)$-deformed $N$-particle beta-ensembles.

arXiv commentv2: minor revision, 56 pp., to appear in Selecta Mathematica

References in corpus (8)

• Limits of BC-type orthogonal polynomials as the number of variables goes to infinity
• Asymptotics of Jack polynomials as the number of variables goes to infinity
• Quantized Vershik-Kerov Theory and Quantized Central Measures on Branching Graphs
• (Shifted) Macdonald Polynomials: q-Integral Representation and Combinatorial Formula
• Asymptotic Formulas for Macdonald Polynomials and the Boundary of the $(q,t)$-Gelfand-Tsetlin Graph
• Macdonald-level extension of beta ensembles and large-N limit transition
• The Elliptic Tail Kernel
• Inductive limits of compact quantum groups and their unitary representations

Cited by in corpus (1)

• Macdonald-level extension of beta ensembles and large-N limit transition