arXiv:1704.05160 Abstract | arXiv Analytics

arXiv:1704.05160 [math.CO]Abstract References Reviews Resources

Linear recurrences for cylindrical networks

Published 2017-04-18Version 1

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.

Comments: 31 pages, 9 figures

Categories: math.CO

Subjects: 05E05, 05A15

Keywords: linear recurrence, cylindrical network, general theorem, schur functions, plane partitions

Related articles: Most relevant | Search more

arXiv:math/0104058 [math.CO] (Published 2001-04-04)

Enumeration of lozenge tilings of hexagons with cut off corners

Mihai Ciucu, Christian Krattenthaler

arXiv:math/0602357 [math.CO] (Published 2006-02-16, updated 2006-02-24)

Schur functions and alternating sums

Marc A. A. van Leeuwen

arXiv:1210.5506 [math.CO] (Published 2012-10-19)