SG::CompPerm
--
compares two permutations
SG::CompPerm(perm1,perm2,kind)
perm1, perm2 | - | any lists denoting permutations |
kind=lexic,cixel,bruhat | - |
The SG::CompPerm
function compares two permutations. The ordering
is set by the argument kind
, and the function returns
TRUE
if
perm1
>=perm2
according to the choosen ordering.
kind=lexic
for lexicographic ordering.
kind=cixel
for inverse lexicographic ordering that is
lexicographic ordering from right to left.
kind=bruhat
to compare the two permutations according to the
Bruhat order.
>> muEC::SG::CompPerm( [3,1,2], [1,3,2], lexic );
TRUE
>> muEC::SG::CompPerm( [3,1,2], [1,3,2], cixel );
FALSE
>> muEC::SG::CompPerm( [3,1,2], [1,3,2], bruhat );
TRUE
MuPAD Combinat, an open source algebraic combinatorics package