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.
Bibliographical noteFunding Information:
This work was partially supported by NSF (grants DMS-1148634, DMS-1351590 to P. P.); and Sloan
© 2017 The Author(s) 2017. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: email@example.com.