Timeline for Asymptotic behaviour of fixed points in permutations
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 18, 2017 at 17:07 | vote | accept | Dominic van der Zypen | ||
| Jul 18, 2017 at 14:51 | comment | added | lambda | Not only is it bounded, it is constant. The probability that a particular symbol is fixed by a random permutation is clearly $1/n$. By linearity of expectation, the expected number of symbols fixed is $n \cdot 1/n = 1$. (This also follows from Burnside's lemma.) | |
| Jul 18, 2017 at 14:48 | answer | added | Fedor Petrov | timeline score: 0 | |
| Jul 18, 2017 at 14:21 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |