Article ID Journal Published Year Pages File Type
5777525 Journal of Combinatorial Theory, Series A 2017 17 Pages PDF
Abstract
Haglund and Loehr (2005) introduced the notion of schedules to enumerate parking functions with a fixed set of cars in each diagonal. In this paper, we extend the notion of schedules and some related results of Hicks (2013) to labeled square paths. We then apply our new results to prove the Square Paths Conjecture.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A proof of the Square Paths Conjecture
Authors
,