Parking functions and triangulation of the associahedron
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.