Macdonald polynomials and extended Gelfand–Tsetlin graph

Research output: Contribution to journalArticlepeer-review

Abstract

Using Okounkov’s q-integral representation of Macdonald polynomials we construct an infinite sequence Ω 1, Ω 2, Ω 3, ⋯ of countable sets linked by transition probabilities from Ω N to Ω N-1 for each N= 2 , 3 , ⋯. The elements of the sets Ω 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.

Original languageEnglish
Article number41
JournalSelecta Mathematica, New Series
Volume27
Issue number3
DOIs
Publication statusPublished - Jul 2021
Externally publishedYes

Keywords

  • Entrance boundary
  • Gelfand–Tsetlin graph
  • Macdonald polynomials
  • Markov chains
  • Okounkov’s q-integral formula

Fingerprint

Dive into the research topics of 'Macdonald polynomials and extended Gelfand–Tsetlin graph'. Together they form a unique fingerprint.

Cite this