English

Macdonald polynomials and extended Gelfand-Tsetlin graph

Probability 2021-06-29 v3 Mathematical Physics Combinatorics math.MP Representation Theory

Abstract

Using Okounkov's qq-integral representation of Macdonald polynomials we construct an infinite sequence Ω1,Ω2,Ω3,\Omega_1,\Omega_2,\Omega_3,\dots of countable sets linked by transition probabilities from ΩN\Omega_N to ΩN1\Omega_{N-1} for each N=2,3,N=2,3,\dots. The elements of the sets ΩN\Omega_N are the vertices of the extended Gelfand-Tsetlin graph, and the transition probabilities depend on the two Macdonald parameters, qq and tt. 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-NN limit transition in (q,t)(q,t)-deformed NN-particle beta-ensembles.

Keywords

Cite

@article{arxiv.2007.06261,
  title  = {Macdonald polynomials and extended Gelfand-Tsetlin graph},
  author = {Grigori Olshanski},
  journal= {arXiv preprint arXiv:2007.06261},
  year   = {2021}
}

Comments

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

R2 v1 2026-06-23T17:04:15.906Z