Geodesic
How to get the weak order out of a digraph ?
Discrete mathematics & theoretical computer science, DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015), DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015) (2015).

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

We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its Möbius function. We show that the weak order on Coxeter groups $A$<sub>$n-1$</sub>, $B$<sub>$n$</sub>, $Ã$<sub>$n$</sub>, and the flag weak order on the wreath product &#8484;<sub>$r$</sub> &#8768; $S$<sub>$n$</sub> introduced by Adin, Brenti and Roichman (2012), are special instances of our construction. We conclude by briefly explaining how to use our work to define quasi-symmetric functions, with a special emphasis on the $A$<sub>$n-1$</sub> case, in which case we obtain the classical Stanley symmetric function. 
@article{DMTCS_2015_special_285_a82,
     author = {Viard, Francois},
     title = {How to get the weak order out of a digraph ?},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)},
     year = {2015},
     doi = {10.46298/dmtcs.2538},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2538/}
}
TY  - JOUR
AU  - Viard, Francois
TI  - How to get the weak order out of a digraph ?
JO  - Discrete mathematics & theoretical computer science
PY  - 2015
VL  - DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2538/
DO  - 10.46298/dmtcs.2538
LA  - en
ID  - DMTCS_2015_special_285_a82
ER  - 
%0 Journal Article
%A Viard, Francois
%T How to get the weak order out of a digraph ?
%J Discrete mathematics & theoretical computer science
%D 2015
%V DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2538/
%R 10.46298/dmtcs.2538
%G en
%F DMTCS_2015_special_285_a82
Viard, Francois. How to get the weak order out of a digraph ?. Discrete mathematics & theoretical computer science, DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015), DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015) (2015). doi : 10.46298/dmtcs.2538. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2538/

Cité par Sources :