当前位置: X-MOL 学术Sel. Math. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Macdonald polynomials and extended Gelfand–Tsetlin graph
Selecta Mathematica ( IF 1.2 ) Pub Date : 2021-06-01 , DOI: 10.1007/s00029-021-00660-3
Grigori Olshanski

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 (qt)-deformed N-particle beta-ensembles.



中文翻译:

麦克唐纳多项式和扩展 Gelfand-Tsetlin 图

使用Macdonald 多项式的Okounkov 的q积分表示,我们构建了一个无限序列\(\Omega _1,\Omega _2,\Omega _3,\dots \)的可数集,由从\(\Omega _N\)\( \Omega _{N-1}\)对于每个\(N=2,3,\dots \)。集合\(\Omega _N\)的元素是扩展的 Gelfand-Tsetlin 图的顶点,转移概率取决于两个 Macdonald 参数qt. 这些数据确定了一系列马尔可夫链,主要结果是对它们入口边界的描述。这项工作起源于渐近表示理论。在随后的论文中,主要结果应用于( qt ) 变形N粒子 β 系综中的大N极限跃迁。

更新日期:2021-06-01
down
wechat
bug