pith. sign in

arxiv: 1010.0515 · v1 · pith:TZJ67F45new · submitted 2010-10-04 · 🧮 math.CO

Inversion arrangements and Bruhat intervals

classification 🧮 math.CO
keywords bruhatcriterionelementsgivengroupidealinversionorder
0
0 comments X
read the original abstract

Let $W$ be a finite reflection group. For a given $w \in 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\in 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\"ostrand. We obtain a short and simple proof of that result. (3) If $W$ is a Weyl group and the Schubert variety indexed by $w \in W$ is rationally smooth, then $w$ satisfies (*).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.