SG::Vect2Perm
--
computes a canonical permutation from a vector
SG::Vect2Perm(l)
l | - | any list of positive integers |
The SG::Vect2Perm
function calculates a canonical permutation from the list
l
, having as cycle type, the reordering of l
.
Let l=[3, 2, 4]
,
gives a permutation in
S3 x S2 x S4 which
is a direct product of cycles of length 3, 2, 4.
SG::Vect2Perm
(l)
>> muEC::SG::Vect2Perm( [3,1,4,1] );
[3, 1, 2, 4, 8, 5, 6, 7, 9]
Cycle2Perm
, Perm2Cycle
, Perm2CycleType
MuPAD Combinat, an open source algebraic combinatorics package