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]$.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [10 references]

https://hal.inria.fr/hal-01215085
Contributor : Coordination Episciences Iam <>
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

File

dmAO0118.pdf
Publisher files allowed on an open archive

Identifiers

• HAL Id : hal-01215085, version 1

Citation

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. ⟨hal-01215085⟩

Record views