Mathematica 9 is now available

Wolfram Library Archive


Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings
Title

Ranking and unranking permutations with applications
Authors

F. Critani
M. Dall'Aglio
G. Di Biase
Journal / Anthology

Innovation in Mathematics: Proceedings of the Second International Mathematica Symposium
Year: 1997
Page range: 99-106
Description

Permutation theory has many applications in several fields of science and technology and it also has a charm in itself. Mathematica is particularly suitable for writing combinatorial algorithms because it provides many easy-to-use tools for handling lists. Several combinatorial built-in functions which involve permutations and combinations are available as standard add-on Mathematica packages. They are grouped under the name of DiscreteMath and are described by their author Steven Skiena in his book [7]. In this paper we focus on ranking and unranking procedures and we examine and implement alternative algorithms to the RankPermutations and NthPermutations already contained in the above mentioned add-on packages. Moreover we provide some applications of these ranking procedures in different topics such as probability, statistics and elementary calculus.
Subject

*Mathematics > Discrete Mathematics > Combinatorics