Combinatorial Formulas Related to an Efficient Representation of Permutations

摘要

We present new combinatorial formulas related to an efficient representation of permutations which gives a lower average entropy than the original representation of permutations. The two distributions that resulted from the application of a transformation to both sets (the original permutations and the set of permutations using the new representation) are compared and analyzed. We also give additional results about our representation.