arXiv Analytics

Sign in

arXiv:1611.02934 [math.CO]AbstractReferencesReviewsResources

Asymptotic analysis of the cyclic structure of permutations

Robertas Petuchovas

Published 2016-11-09Version 1

This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper asymptotic formulas are obtained. The latter are applied in approximations of the cycle vector distribution of a random permutation. The saddle-point method, Lagrange-B\"urmann inversion formula, Laplace transformations, and other techniques of complex analysis are applied.

Comments: Doctoral dissertation, Vilnius, 2016
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2105.04334 [math.CO] (Published 2021-05-10)
Asymptotic Analysis of q-Recursive Sequences
arXiv:0803.0848 [math.CO] (Published 2008-03-06)
Asymptotic analysis of $k$-noncrossing matchings
arXiv:1009.4938 [math.CO] (Published 2010-09-24, updated 2010-12-10)
Enumerative and asymptotic analysis of a moduli space