Skip to Main content Skip to Navigation
Conference papers

EL-labelings and canonical spanning trees for subword complexes

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01229670
Contributor : Alain Monteil <>
Submitted on : Tuesday, November 17, 2015 - 10:19:39 AM
Last modification on : Monday, November 9, 2020 - 2:56:03 PM
Long-term archiving on: : Thursday, February 18, 2016 - 11:34:40 AM

File

dmAS0152.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01229670, version 1

Collections

Citation

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. ⟨hal-01229670⟩

Share

Metrics

Record views

201

Files downloads

787