Parking functions and triangulation of the associahedron
Algebraic Topology
2007-05-23 v1 Combinatorics
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.
Cite
@article{arxiv.math/0510380,
title = {Parking functions and triangulation of the associahedron},
author = {Jean-Louis Loday},
journal= {arXiv preprint arXiv:math/0510380},
year = {2007}
}
Comments
15 pages