Linear recurrences for cylindrical networks
Combinatorics
2018-05-04 v3
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\"om-Gessel-Viennot theorem. We illustrate the result by applying it to Schur functions, plane partitions, and domino tilings.
Cite
@article{arxiv.1704.05160,
title = {Linear recurrences for cylindrical networks},
author = {Pavel Galashin and Pavlo Pylyavskyy},
journal= {arXiv preprint arXiv:1704.05160},
year = {2018}
}
Comments
32 pages, 9 figures; v3: references updated and added a conjecture on total positivity