Linear Recurrences for Cylindrical Networks

被引:0
|
作者
Galashin, Pavel [1 ]
Pylyavskyy, Pavlo [2 ]
机构
[1] MIT, Dept Math, Cambridge, MA 02139 USA
[2] Univ Minnesota, Dept Math, Minneapolis, MN 55414 USA
关键词
VICIOUS WALKERS; YOUNG TABLEAUX; FRIENDLY WALKERS; PATHS; DETERMINANTS;
D O I
10.1093/imrn/rnx241
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We prove a general theorem that gives a linear recurrence for tuples of paths in every cylindrical network. This can be seen as a cylindrical analog of the Lindstrom-Gessel-Viennot theorem. We illustrate the result by applying it to Schur functions, plane partitions, and domino tilings.
引用
收藏
页码:4047 / 4080
页数:34
相关论文
共 50 条