Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Signed tree associah ...
Conference paper

Signed tree associahedra

Vincent Pilaud ORCID (1)
(1) Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2013
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Proceedings
DOI
10.46298/dmtcs.2402
License
https://about.hal.science/hal-authorisation-v1
Indicators
668
Views
801
Downloads

Signed tree associahedra

Vincent Pilaud ORCID (1)
(1) Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract
English
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.
French
Un associaèdre est un polytope dont les sommets correspondent aux triangulations d’un polygone convexe et dont les arêtes correspondent aux flips entre ces triangulations. J.-L. Loday a donné une construction particulièrement élégante de l’associaèdre qui a été généralisée dans deux directions : d’une part pour obtenir des réalisations des associaèdres de graphes, et d’autre part pour obtenir de multiples réalisations de l’associaèdre paramétrées par une suite de signes. L’objectif de ce travail est d’unifier et d’étendre ces constructions aux associaèdres d’arbres signés.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • Graph associahedra
  • permutahedra
  • nested complexes
  • signed spines
  • polytopal realizations
Mathematics Subject Classification 2020
  • 05C30 - Enumeration in graph theory
Cited by

Source: OpenCitations

  • Qué anidaedra son quitaedra?

    Revista Colombiana de Matemáticas

    Authors : Vincent Pilaud ORCID

    Journal reference : Volume 51, 2017, pp. 21-42

    DOI : 10.15446/recolma.v51n1.66833
  • Permutrees

    Algebraic Combinatorics

    Authors : Vincent Pilaud, Viviane Pons

    Journal reference : Volume 1, 2018, pp. 173-224

    DOI : 10.5802/alco.1
  • Quotientopes

    arXiv (Cornell University)

    Authors : Vincent Pilaud ORCID, Francisco Santos ORCID

    Journal reference : Volume 51, 2019, pp. 406-420

    DOI : 10.1112/blms.12231
Preview
Loading PDF preview...