[MathJax on]

3 Permutation Encoding

A permutation π=π_1 ... π_n has rank encoding p_1 ... p_n where p_i= |{j : j ≥ i, π_j ≤ π_i } |. In other words the rank encoded permutation is a sequence of p_i with 1≤ i≤ n, where p_i is the rank of π_i in {π_i,π_i+1,... ,π_n}. [2]

The encoding of the permutation 3 2 5 1 6 7 4 8 9 is done as follows:

Decoding a permutation is done in a similar fashion, taking the sequence p_1 ... p_n and using the reverse process will lead to the permutation π=π_1 ... π_n, where π_i is determined by finding the number that has rank p_i in {π_i, π_i+1, ... , π_n}.

The sequence 3 2 3 1 2 2 1 1 1 is decoded as:

3.1 Encoding and Decoding

3.1-1 RankEncoding

Returns: A list that represents the rank encoding of the permutation p.

Using the algorithm above RankEncoding turns the permutation p into a list of integers.

gap> RankEncoding([3, 2, 5, 1, 6, 7, 4, 8, 9]);
[ 3, 2, 3, 1, 2, 2, 1, 1, 1 ]
gap> RankEncoding([ 4, 2, 3, 5, 1 ]);                 
[ 4, 2, 2, 2, 1 ]
gap> 

3.1-2 RankDecoding

Returns: A permutation in list form.

A rank encoded permutation is decoded by using the reversed process from encoding, which is also explained above.

gap> RankDecoding([ 3, 2, 3, 1, 2, 2, 1, 1, 1 ]);
[ 3, 2, 5, 1, 6, 7, 4, 8, 9 ]
gap> RankDecoding([ 4, 2, 2, 2, 1 ]);
[ 4, 2, 3, 5, 1 ]
gap> 

3.1-3 SequencesToRatExp

Returns: A rational expression that describes all the words in list.

A list of sequences is turned into a rational expression by concatenating each sequence and unifying all of them.

gap> SequencesToRatExp([[ 1, 1, 1, 1, 1 ],[ 2, 1, 2, 2, 1 ],[ 3, 2, 1, 2, 1 ],
> [ 4, 2, 3, 2, 1 ]]);
11111U21221U32121U42321
gap> 

generated by GAPDoc2HTML