Compatibility fans realizing graphical nested complexes

Abstract : 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 realizations of classical associahedra and the analogy between finite type cluster complexes and nested complexes incited us 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 extend F. Chapoton, S. Fomin and A. Zelevinsky's construction (2002) for type B and C generalized associahedra.
Keywords : Combinatorics
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download
Contributor : Ccsd Sciencesconf.Org <>
Submitted on : Wednesday, June 26, 2019 - 5:00:24 PM
Last modification on : Tuesday, November 5, 2019 - 3:24:03 PM


  • HAL Id : hal-02166355, version 1



Thibault Manneville, Vincent Pilaud. Compatibility fans realizing graphical nested complexes. 28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada. ⟨hal-02166355⟩



Record views


Files downloads