Geodesic
EL-labelings and canonical spanning trees for subword complexes
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013) (2013).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2013_special_264_a12,
     author = {Pilaud, Vincent and Stump, Christian},
     title = {EL-labelings and canonical spanning trees for subword complexes},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)},
     year = {2013},
     doi = {10.46298/dmtcs.2328},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2328/}
}
TY  - JOUR
AU  - Pilaud, Vincent
AU  - Stump, Christian
TI  - EL-labelings and canonical spanning trees for subword complexes
JO  - Discrete mathematics & theoretical computer science
PY  - 2013
VL  - DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2328/
DO  - 10.46298/dmtcs.2328
LA  - en
ID  - DMTCS_2013_special_264_a12
ER  - 
%0 Journal Article
%A Pilaud, Vincent
%A Stump, Christian
%T EL-labelings and canonical spanning trees for subword complexes
%J Discrete mathematics & theoretical computer science
%D 2013
%V DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2328/
%R 10.46298/dmtcs.2328
%G en
%F DMTCS_2013_special_264_a12
Pilaud, Vincent; Stump, Christian. EL-labelings and canonical spanning trees for subword complexes. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013) (2013). doi : 10.46298/dmtcs.2328. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2328/

Cité par Sources :