combinatorics / Permutation combinatorics
An asymptotic formula for $p(k)$, the limiting probability that a random permutation has an invariant set of size $k$: it is asymptotically $k^{-\delta}(1+o(1))$ times a smooth positive function, sharpening a line of estimates running through Łuczak-Pyber and Eberhard-Ford-Green.
Temporal state
No reconciled state yet.
Append-only history
An asymptotic formula for $p(k)$, the limiting probability that a random permutation has an invariant set of size $k$: it is asymptotically $k^{-\delta}(1+o(1))$ times a smooth positive function, sharpening a line of estimates running through Łuczak-Pyber and Eberhard-Ford-Green.
Research memory
An asymptotic formula for $p(k)$, the limiting probability that a random permutation has an invariant set of size $k$: it is asymptotically $k^{-\delta}(1+o(1))$ times a smooth positive function, sharpening a line of estimates running through Łuczak-Pyber and Eberhard-Ford-Green.
Evidence graph
No public relationships recorded yet.