Parking functions and triangulation of the associahedron

Simple item page
dc.creatorLoday, Jean-Louis
dc.date2005-10-18
dc.date.accessioned2026-07-07T06:47:36Z
dc.date.available2026-07-07T06:47:36Z
dc.descriptionWe 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.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/math/0510380
dc.identifierhttp://arxiv.org/abs/math/0510380
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/103710
dc.subjectAlgebraic Topology
dc.subjectCombinatorics
dc.subject16A24; 16W30; 17A30; 18D50; 81R60
dc.titleParking functions and triangulation of the associahedron
dc.typetext

Files

Collections

arXiv