Unfair permutations (Q648984)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Unfair permutations |
scientific article; zbMATH DE number 5982474
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unfair permutations |
scientific article; zbMATH DE number 5982474 |
Statements
Unfair permutations (English)
0 references
29 November 2011
0 references
In this paper the authors consider permutations generated by letting \(n\) players draw \(n\) times from the uniform distribution, where player \(i\) draws \(i\) times and reports the maximum number drawn. They call these permutations ``unfair'', and obtain detailed statistics about them. For example, they compute the mean and variance of the number of players ranked below player \(i\) and the number of anti-inversions. The formulas typically involve rational functions of \(n\) and the harmonic numbers.
0 references
permutation
0 references
partition
0 references
probability distribution
0 references
inversions
0 references
ascents
0 references
