Linear recurrences for cylindrical networks
arXiv:1704.05160 · doi:10.1093/imrn/rnx241
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.
32 pages, 9 figures; v3: references updated and added a conjecture on total positivity