Random Permutation statistics: Group, Permutation, Selection Algorithm, Fundamental Theorem of Combinatorial Enumeration, Generating Function, Formal Power Series

Bol

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The statistics of random permutations, such as the cycle structure of a random permutation are of fundamental importance in the analysis of algorithms, especially of sorting algorithms, which operate on random permutations. Suppose, for example, that we are using quickselect (a cousin of quicksort) to select a random element of a random permutation. Quickselect will perform a partial sort on the array, as it partitions the array according to the pivot. Hence a permutation will be less disordered after quickselect has been performed. The amount of disorder that remains may be analysed with generating functions. These generating functions depend in a fundamental way on the generating functions of random permutation statistics. Hence it is of vital importance to compute these generating functions.

Amazon

Pagina's: 104, Paperback, Betascript Publishers