Vincent Pilaud - Signed tree associahedra

dmtcs:2402 - Discrete Mathematics & Theoretical Computer Science, January 1, 2014, DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014) - https://doi.org/10.46298/dmtcs.2402
Signed tree associahedraArticle

Authors: Vincent Pilaud ORCID1

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.

https://doi.org/10.46298/dmtcs.2402
Source: HAL:hal-01207614v1
Volume: DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Section: Proceedings
Published on: January 1, 2014
Imported on: November 21, 2016
Keywords: Graph associahedra,permutahedra,nested complexes,signed spines,polytopal realizations,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

Classifications

Mathematics Subject Classification 20201
Sources:
  • [1] zbMATH Open.

3 Documents citing this article

Share and export

Consultation statistics

This page has been seen 289 times.
This article's PDF has been downloaded 506 times.