Cycle Lengths in a Permutation are Typically Poisson

The set of cycle lengths of almost all permutations in Sn are "Poisson distributed": we show that this remains true even when we restrict the number of cycles in the permutation. The formulas we develop allow us to also show that almost all permutations with a given number of cycles have a certain "normal order" (in the spirit of the Erdos-Tur

• Type: Journal
• Year: 2006
• Where: COMBINATORICS
• Authors: Andrew Granville
• Keywords: COMBINATORICS 2006, Cycle Lengths, Normal Order, Permutations