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 |
Bibliographical note
Publisher Copyright:© 2017 The Author(s) 2017. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: [email protected].
Fingerprint
Dive into the research topics of 'Linear Recurrences for Cylindrical Networks'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS