| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656068 | Journal of Combinatorial Theory, Series A | 2009 | 13 Pages |
Abstract
We study the asymptotic behavior of two statistics defined on the symmetric group Sn when n tends to infinity: the number of elements of Sn having k records, and the number of elements of Sn for which the sum of the positions of their records is k. We use a probabilistic argument to show that the scaled asymptotic behavior of these statistics can be described by remarkably simple functions.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
