Vincent Pilaud ; Christian Stump - Generalized associahedra via brick polytopes

dmtcs:3021 - Discrete Mathematics & Theoretical Computer Science, January 1, 2012, DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) - https://doi.org/10.46298/dmtcs.3021
Generalized associahedra via brick polytopes

Authors: Vincent Pilaud ORCID-iD; Christian Stump

    We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster complexes of finite types. For the latter, the brick polytopes turn out to coincide with the known realizations of generalized associahedra, thus opening new perspectives on these constructions. This new approach yields in particular the vertex description and a relevant Minkowski sum decomposition of generalized associahedra.


    Volume: DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
    Section: Proceedings
    Published on: January 1, 2012
    Imported on: January 31, 2017
    Keywords: Coxeter-Catalan combinatorics,subword complexes,cluster complexes,generalized associahedra,Coxeter- sortable elements,Cambrian lattices,Cambrian fans,20F55, 52B11, 06A07,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]
    Fundings :
      Source : OpenAIRE Research Graph
    • Combinatorial methods, from enumerative topology to random discrete structures and compact data representations.; Funder: European Commission; Code: 208471

    Share

    Consultation statistics

    This page has been seen 115 times.
    This article's PDF has been downloaded 170 times.