The (strong) Bruhat order is a partial order on the symmetric group $\mathfrak{S}_n$. See [BB05] for more details on Bruhat order.
|
|
|
The (right) weak Bruhat order is a partial order on the symmetric group $\mathfrak{S}_n$. For two permutations $p$ and $q$, $w \leq_R v$ if and only if $\ell(w) + \ell(v^{-1} w) = \ell(v)$, where $\ell$ denotes the length(Permutation) of a permutation and $\leq_R$ is the right weak Bruhat order.
|
|
|
The optional argument Side can be used to specify which weak Bruhat order to use. The current options are "left" and "right" (default).
|
We can use these orders to construct the poset of $\mathfrak{S}_n$ using the Posets package. The symmetricGroupPoset method constructs the poset of $\mathfrak{S}_n$ with the Bruhat order for convenience.
|
|
This allows us to verify, for example, that the weak Bruhat order is rank-symmetric and Sperner [GG20].
|
|
|
|
|
The source of this document is in Permutations/Documentation/packageDocs.m2:344:0.