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.
机构:
Univ Bristol, Algebra Coding Res Grp, Commun Res Ctr, Bristol, Avon, EnglandUniv Bristol, Algebra Coding Res Grp, Commun Res Ctr, Bristol, Avon, England
机构:
Nova Univ Lisbon, Fac Sci & Technol, Dept Math & GeoBioTec, P-2829516 Quinta Da Torre, Caparica, PortugalNova Univ Lisbon, Fac Sci & Technol, Dept Math & GeoBioTec, P-2829516 Quinta Da Torre, Caparica, Portugal
机构:
Univ Banja Luka, Dept Math & Informat, Banja Luka 78000, Republic Of Srp, Bosnia & HercegUniv Banja Luka, Dept Math & Informat, Banja Luka 78000, Republic Of Srp, Bosnia & Herceg