Shortest path poset of Bruhat intervals
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 p...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2011-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/2902/pdf |