From Bruhat intervals to intersection lattices and a conjecture of Postnikov
We prove the conjecture of A. Postnikov that ($\mathrm{A}$) the number of regions in the inversion hyperplane arrangement associated with a permutation $w \in \mathfrak{S}_n$ is at most the number of elements below $w$ in the Bruhat order, and ($\mathrm{B}$) that equality holds if and only if $w$ av...
| Principais autores: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | English |
| Publicado em: |
Discrete Mathematics & Theoretical Computer Science
2008-01-01
|
| coleção: | Discrete Mathematics & Theoretical Computer Science |
| Assuntos: | |
| Acesso em linha: | https://dmtcs.episciences.org/3648/pdf |