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.