Abstract
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 Lindström-Gessel-Viennot theorem. We illustrate the result by applying it to Schur functions, plane partitions, and domino tilings.
Original language | English (US) |
---|---|
Pages (from-to) | 4047-4080 |
Number of pages | 34 |
Journal | International Mathematics Research Notices |
Volume | 2019 |
Issue number | 13 |
DOIs | |
State | Published - Jul 1 2019 |
Externally published | Yes |
Bibliographical note
Funding Information:This work was partially supported by NSF (grants DMS-1148634, DMS-1351590 to P. P.); and Sloan
Publisher Copyright:
© 2017 The Author(s) 2017. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permission@oup.com.