Iterated Permutations

  • Gregory V. Bard


The purpose of this chapter is to allow us to calculate what fraction of permutations in S n have a particular property ø, in the limit as n tends to infinity. This will be accomplished via analytic combinatorics.

Combinatorics is the branch of mathematics concerned with counting objects. The technique of using a function of a variable to count objects of various sizes, using the properties of multiplication and addition of series as an aid, is accredited to Pierre-Simon Laplace [116, Ch. “Invit.”].


Success Probability Random Permutation Block Cipher Cycle Count Disjoint Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag US 2009

Authors and Affiliations

  1. 1.Department of MathematicsFordham UniversityBronxUSA

Personalised recommendations