A proof of the Square Paths Conjecture

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.