Macaulay2 » Documentation
Packages » Permutations :: strongBruhatOrder
next | previous | forward | backward | up | index | toc

strongBruhatOrder -- compares two permutations in the (strong) Bruhat order

Description

The (strong) Bruhat order is a partial order on the symmetric group $\mathfrak{S}_n$. See [BB05] for more details on the strong Bruhat order.

i1 : p = permutation {3,5,1,2,4}

o1 = Permutation{3, 5, 1, 2, 4}

o1 : Permutation
i2 : q = permutation {4,5,1,2,3}

o2 = Permutation{4, 5, 1, 2, 3}

o2 : Permutation
i3 : strongBruhatOrder(p, q)

o3 = true

References

See also

Ways to use strongBruhatOrder:

  • strongBruhatOrder(Permutation,Permutation)

For the programmer

The object strongBruhatOrder is a method function.


The source of this document is in /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/Permutations/Documentation/mainDocs.m2:714:0.