From Bruhat intervals to intersection lattices and a conjecture of Postnikov

  • Axel Hultman
  • , Svante Linusson
  • , John Shareshian
  • , Jonas Sjöstrand

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish
Pages203-214
Number of pages12
StatePublished - 2008
Event20th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'08 - Valparaiso, Chile
Duration: Jun 23 2008Jun 27 2008

Conference

Conference20th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'08
Country/TerritoryChile
CityValparaiso
Period06/23/0806/27/08

Keywords

  • Bruhat order
  • Intersection lattices
  • Inversion arrangements

Fingerprint

Dive into the research topics of 'From Bruhat intervals to intersection lattices and a conjecture of Postnikov'. Together they form a unique fingerprint.

Cite this