Abstract
We prove the conjecture of A. Postnikov that (A) the number of regions in the inversion hyperplane arrangement associated with a permutation w ∈ S n is at most the number of elements below w in the Bruhat order, and (B) that equality holds if and only if w avoids the patterns 4231, 35142, 42513 and 351624. Furthermore, assertion (A) is extended to all finite reflection groups.
| Original language | English |
|---|---|
| Pages | 203-214 |
| Number of pages | 12 |
| State | Published - 2008 |
| Event | 20th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'08 - Valparaiso, Chile Duration: Jun 23 2008 → Jun 27 2008 |
Conference
| Conference | 20th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'08 |
|---|---|
| Country/Territory | Chile |
| City | Valparaiso |
| Period | 06/23/08 → 06/27/08 |
Keywords
- Bruhat order
- Intersection lattices
- Inversion arrangements