3 problems

Let $n$ be the size of a random permutation, and let $T_{n,p}$ denote the number of strong interval trees with $n$ leaves and $p$ prime vertices. Define … where $T_n$ is the total…

Universality conjecture. This property holds in greater generality, including for more distributions and more algorithms.

Let Yaroslavskiy's algorithm and classic Quicksort be implementations of Quicksort, and consider computational models that assign constant cost contributions to individual instruct…