Bruhat ordering

• Let $W$ be a Coxeter group

def (Bruhat ordering)

Define a partial order on the elements of $W$ as follows :

$u < v$ whenever $u = t v$ for some reflection $t$ and $\ell(u) < \ell(v)$.

• example : http://groupprops.subwiki.org/wiki/File:Bruhatons3.png

thm

Given $x,y\in W$, we have $x<y$ in the Bruhat order if and only if there is a reduced expression $y=s_{i_1}s_{i_2}\cdots s_{i_k}$ such that $x$ can be written as a product of some of the $s_{i_j}$ in the same order as they appear in $y$.

computational resource

• https://drive.google.com/file/d/0B8XXo8Tve1cxdko1Z0hPZUNhZTQ/view