array | array(p) --- return p as an array |
cycles | cycles(p) returns a cell array containing the cycle structure of p |
display | display(p) --- display a permutation in disjoint cycle form. |
eq | test if p == q |
inv | inv(p) returns the inverse permutation of p |
length | length(p) gives the size of the permutation |
longest_cycle | longest_cycle(p) -- return the length of the longest cycle in p |
matrix | matrix(p) gives a permutation matrix version of p |
mpower | p^t is p multiplied by itself t times. May have t <= 0. |
mtimes | p*q is the composition of p and q |
ne | test if p ~= q |
permutation | constructor for the permutation class |
random | random(p) --- return a random reordering of the elements of p |
sign | sign of a permutation (1 for even, -1 for odd) |
size | size(p) returns the number of elements permuted and the number of cycles. |
subsref | p(k) returns the result of p applied to k. |