vix.ing · top · new · best · stats · spec

Inversion arrangements and Bruhat intervals

2010/10/04 by Axel Hultman, Hultman, Axel
Mathematics · #Advanced Algebra and Geometry #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Combinatorics (math.CO) #FOS: Mathematics

paper · pdf · doi:10.48550/arxiv.1010.0515

openalex publication_date 2010/10/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let W be a finite reflection group. For a given w ∈ W, the following assertion may or may not be satisfied: (*) The principal Bruhat order ideal of w contains as many elements as there are regions in the inversion hyperplane arrangement of w. We present a type independent combinatorial criterion which characterises the elements w∈ W that satisfy (*). A couple of immediate consequences are derived: (1) The criterion only involves the order ideal of w as an abstract poset. In this sense, (*) is a poset-theoretic property. (2) For W of type A, another characterisation of (*), in terms of pattern avoidance, was previously given in collaboration with Linusson, Shareshian and Sjöstrand. We obtain a short and simple proof of that result. (3) If W is a Weyl group and the Schubert variety indexed by w ∈ W is rationally smooth, then w satisfies (*).

Citations

Related