Thibault Manneville ; Vincent Pilaud - Compatibility fans realizing graphical nested complexes

dmtcs:6400 - Discrete Mathematics & Theoretical Computer Science, April 22, 2020, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) - https://doi.org/10.46298/dmtcs.6400
Compatibility fans realizing graphical nested complexesArticle

Authors: Thibault Manneville 1; Vincent Pilaud ORCID1

Graph associahedra are polytopes realizing the nested complex N(G) on connected subgraphs of a graph G.While all known explicit constructions produce polytopes with the same normal fan, the great variety of fan realizationsof classical associahedra and the analogy between finite type cluster complexes and nested complexes incitedus to transpose S. Fomin and A. Zelevinsky's construction of compatibility fans for generalized associahedra (2003)to graph associahedra. Using a compatibility degree, we construct one fan realization of N(G) for each of its facets.Specifying G to paths and cycles, we recover a construction by F. Santos for classical associahedra (2011) and extendF. Chapoton, S. Fomin and A. Zelevinsky's construction (2002) for type B and C generalized associahedra.


Volume: DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
Published on: April 22, 2020
Imported on: July 4, 2016
Keywords: Combinatorics,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Consultation statistics

This page has been seen 180 times.
This article's PDF has been downloaded 194 times.