EL-Labelings and Canonical Spanning Trees for Subword Complexes - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2013

EL-Labelings and Canonical Spanning Trees for Subword Complexes

Résumé

We describe edge labelings of the increasing flip graph of a subword complex on a finite Coxeter group, and study applications thereof. On the one hand, we show that they provide canonical spanning trees of the facet-ridge graph of the subword complex, describe inductively these trees, and present their close relations to greedy facets. Searching these trees yields an efficient algorithm to generate all facets of the subword complex, which extends the greedy flip algorithm for pointed pseudotriangulations. On the other hand, when the increasing flip graph is a Hasse diagram, we show that the edge labeling is indeed an EL-labeling and derive further combinatorial properties of paths in the increasing flip graph. These results apply in particular to Cambrian lattices, in which case a similar EL-labeling was recently studied by M. Kallipoliti and H. Mühle .
Fichier principal
Vignette du fichier
PilaudStump_ELlabeling&Trees_Fields.pdf (611.23 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01276815 , version 1 (20-02-2016)

Identifiants

Citer

Vincent Pilaud, Christian Stump. EL-Labelings and Canonical Spanning Trees for Subword Complexes. Karoly Bezdek; Antoine Deza; Yinyu Ye. Discrete Geometry and Optimization, 69, Springer International Publishing, pp.213-248, 2013, Fields Institute Communications Series, 978-3-319-00199-9. ⟨10.1007/978-3-319-00200-2_13⟩. ⟨hal-01276815⟩
214 Consultations
88 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More