Combinatorial reciprocity for non-intersecting paths
arXiv:2301.00405 · doi:10.54550/ECA2023V3S2R13
Abstract
We prove a combinatorial reciprocity theorem for the enumeration of non-intersecting paths in a linearly growing sequence of acyclic planar networks. We explain two applications of this theorem: reciprocity for fans of bounded Dyck paths, and reciprocity for Schur function evaluations with repeated values.
18 pages, 8 figures; v2: final version to appear in "Enumerative Combinatorics and Applications"