Abstract
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.”].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag US
About this chapter
Cite this chapter
Bard, G.V. (2009). Iterated Permutations. In: Algebraic Cryptanalysis. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-88757-9_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-88757-9_4
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-88756-2
Online ISBN: 978-0-387-88757-9
eBook Packages: Computer ScienceComputer Science (R0)