Parking functions and triangulation of the associahedron

2005/10/18 by Loday, Jean-Louis
#16A24 #16W30 #17A30 #18D50 #81R60 #Algebraic Topology (math.AT) #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.math/0510380

Abstract

We show that a minimal triangulation of the associahedron (Stasheff polytope) of dimension n is made of (n+1)^n-1 simplices. We construct a natural bijection with the set of parking functions from a new interpretation of parking functions in terms of shuffles.

Related

• Exploring Parking Functions: Poset and Polytope Perspectives
• Combinatorics of generalized parking-function polytopes
• Realization of the Stasheff polytope
• Generalized parking function polytopes
• Parking Function Polytopes