Saúl A. Blanco
-
Shortest path poset of Bruhat intervals
dmtcs:2902 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2011,
DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
-
https://doi.org/10.46298/dmtcs.2902
Shortest path poset of Bruhat intervalsConference paper
Authors: Saúl A. Blanco 1
0000-0003-2315-5331
Saúl A. Blanco
1 Department of Mathematics [Cornell]
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].