EL-labelings and canonical spanning trees for subword complexes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2013

EL-labelings and canonical spanning trees for subword complexes


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
dmAS0152.pdf (439.79 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01229670 , version 1 (17-11-2015)



Vincent Pilaud, Christian Stump. EL-labelings and canonical spanning trees for subword complexes. 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.611-622, ⟨10.46298/dmtcs.2328⟩. ⟨hal-01229670⟩
85 View
539 Download



Gmail Facebook Twitter LinkedIn More