Linear Recurrences for Cylindrical Networks

Pavel Galashin, Pavlo Pylyavskyy

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)4047-4080
Number of pages34
JournalInternational Mathematics Research Notices
Issue number13
StatePublished - Jul 1 2019
Externally publishedYes

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:


Dive into the research topics of 'Linear Recurrences for Cylindrical Networks'. Together they form a unique fingerprint.

Cite this