Combinatorial reciprocity for non-intersecting paths
Combinatorics
2023-12-21 v2
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.
Cite
@article{arxiv.2301.00405,
title = {Combinatorial reciprocity for non-intersecting paths},
author = {Sam Hopkins and Gjergji Zaimi},
journal= {arXiv preprint arXiv:2301.00405},
year = {2023}
}
Comments
18 pages, 8 figures; v2: final version to appear in "Enumerative Combinatorics and Applications"