Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Shortest path poset of Bruhat intervals

Abstract : 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]$.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Tuesday, October 13, 2015 - 3:06:29 PM
Last modification on : Friday, June 11, 2021 - 5:12:08 PM
Long-term archiving on: : Thursday, April 27, 2017 - 12:18:16 AM


Publisher files allowed on an open archive




Saúl A. Blanco. Shortest path poset of Bruhat intervals. 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.191-198, ⟨10.46298/dmtcs.2902⟩. ⟨hal-01215085⟩



Record views


Files downloads