zbMATH — the first resource for mathematics

Signed tree associahedra. (English. French summary) Zbl 1394.52012
Proceedings of the 26th international conference on formal power series and algebraic combinatorics, FPSAC 2014, Chicago, IL, USA, June 29 – July 3, 2014. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 309-320 (2014).
Summary: An associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon and whose edges correspond to flips between them. J.-L. Loday gave a particularly elegant realization of the associahedron, which was then generalized in two directions: on the one hand to obtain realizations of graph associahedra, and on the other hand to obtain multiple realizations of the associahedron parametrized by a sequence of signs. The goal of this paper is to unify and extend these two constructions to signed tree associahedra.
For the entire collection see [Zbl 1298.05004].

52B11 \(n\)-dimensional polytopes
05C05 Trees
52B12 Special polytopes (linear programming, centrally symmetric, etc.)
Full Text: Link arXiv