Geodesic
Shortest path poset of Bruhat intervals
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) (2011).

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

Let $[u,v]$ be a Bruhat interval and $B(u,v)$ be its corresponding Bruhat graph. The combinatorial and topological structure of the longest $u-v$ paths of $B(u,v)$ has been extensively studied and is well-known. Nevertheless, not much is known of the remaining paths. Here we describe combinatorial properties of the shortest $u-v$ paths of $B(u,v)$. We also derive the non-negativity of some coefficients of the complete mcd-index of $[u,v]$. 
@article{DMTCS_2011_special_260_a15,
     author = {Blanco, Sa\'ul A.},
     title = {Shortest path poset of {Bruhat} intervals},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)},
     year = {2011},
     doi = {10.46298/dmtcs.2902},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2902/}
}
TY  - JOUR
AU  - Blanco, Saúl A.
TI  - Shortest path poset of Bruhat intervals
JO  - Discrete mathematics & theoretical computer science
PY  - 2011
VL  - DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2902/
DO  - 10.46298/dmtcs.2902
LA  - en
ID  - DMTCS_2011_special_260_a15
ER  - 
%0 Journal Article
%A Blanco, Saúl A.
%T Shortest path poset of Bruhat intervals
%J Discrete mathematics & theoretical computer science
%D 2011
%V DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2902/
%R 10.46298/dmtcs.2902
%G en
%F DMTCS_2011_special_260_a15
Blanco, Saúl A. Shortest path poset of Bruhat intervals. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) (2011). doi : 10.46298/dmtcs.2902. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2902/

Cité par Sources :