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 t...
Main Authors: | Vincent Pilaud, Christian Stump |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2013-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2328/pdf |
Similar Items
-
Counting occurrences of some subword patterns
by: Alexander Burstein, et al.
Published: (2003-01-01) -
The Möbius function of generalized subword order
by: Peter R. W. McNamara, et al.
Published: (2012-01-01) -
Clustered Spanning Tree - Conditions for Feasibility
by: Nili Guttmann-Beck, et al.
Published: (2019-08-01) -
Structure of spanning trees on the two-dimensional Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2011-01-01) -
Spanning forests on the Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2008-01-01)