Linear Recurrences for Cylindrical Networks

Pavel Galashin; Pavlo Pylyavskyy

doi:10.1093/imrn/rnx241

Linear Recurrences for Cylindrical Networks

Pavel Galashin, Pavlo Pylyavskyy

Mathematics

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1093/imrn/rnx241
State	Published - Jul 1 2019

Access

10.1093/imrn/rnx241

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

Cite this

@article{68e01d92164f47e8a99b01fb6407f7b5,

title = "Linear Recurrences for Cylindrical Networks",

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{\"o}m-Gessel-Viennot theorem. We illustrate the result by applying it to Schur functions, plane partitions, and domino tilings.",

author = "Pavel Galashin and Pavlo Pylyavskyy",

year = "2019",

month = jul,

day = "1",

doi = "10.1093/imrn/rnx241",

language = "English (US)",

volume = "2019",

pages = "4047--4080",

journal = "International Mathematics Research Notices",

issn = "1073-7928",

publisher = "Oxford University Press",

number = "13",

}

TY - JOUR

T1 - Linear Recurrences for Cylindrical Networks

AU - Galashin, Pavel

AU - Pylyavskyy, Pavlo

PY - 2019/7/1

Y1 - 2019/7/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85083880666&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85083880666&partnerID=8YFLogxK

U2 - 10.1093/imrn/rnx241

DO - 10.1093/imrn/rnx241

M3 - Article

AN - SCOPUS:85083880666

VL - 2019

SP - 4047

EP - 4080

JO - International Mathematics Research Notices

JF - International Mathematics Research Notices

SN - 1073-7928

IS - 13

ER -