A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We obtain an explicit double contour integral expression for the determinantal correlation kernel of this ensemble (and also of its q-deformation).
This provides new tools for asymptotic analysis of uniformly random lozenge tilings of polygons on the triangular lattice; or, equivalently, of random stepped surfaces. We work with a class of polygons which allows arbitrarily large number of sides. We show that the local limit behavior of random tilings (as all dimensions of the polygon grow) is directed by ergodic translation invariant Gibbs measures. The slopes of these measures coincide with the ones of tangent planes to the corresponding limit shapes described by Kenyon and Okounkov in arXiv:math-ph/0507007. We also prove that at the edge of the limit shape, the asymptotic behavior of random tilings is given by the Airy process.
In particular, our results cover the most investigated case of random boxed plane partitions (when the polygon is a hexagon).
The boundary of the Gelfand-Tsetlin graph: A new approach
Gelfand-Tsetlin图是一个编码酉群的不可约特征标分支的无限分次图。Gelfand-Tsetlin图的边界至少有三种表现形式--离散位势论边界、无限维酉群的有限不可分解特征标集和双无限全正序列集. Albert Edrei和Dan Voiculescu的一个旧的深度结果提供了边界的明确描述;它可以实现为无限维坐标空间中的一个区域。本文包含了一个新的方法Edrei-Voiculescu定理。它是基于一个新的显式公式的数量的半标准杨tableaux一个给定的斜形状(或Gelfand-Tsetlin计划的梯形)。该公式是通过对称函数理论得到的,新的Schur类对称函数在推导中起着关键作用。
Asymptotics of uniformly random lozenge tilings of polygons. Gaussian free field
我们研究了三角形网格上多边形均匀菱形拼接所对应的随机台阶表面的大尺度高度波动。对于一类多边形(允许任意大的边数),我们表明,这些波动是渐近高斯自由(无质量)场。这补充了在Kenyon [Comm.Math.Phys.281(2008)675-709]中获得的关于没有极限形状的冻结小平面的区域的平铺的类似结果。在我们的渐近分析中,我们使用显式双围道积分公式用于先前在Petrov [Asymptotics of random lozenge tilings via Gelfand-Tsetlin schemes(2012)Preprint]中获得的模型的行列式相关核。