Random permutations turn universal at quadratic length: a log factor drops out, and Alon's weaker problem falls
A uniformly random permutation of quadratic length contains every permutation of that length as a pattern with high probability; the new proof removes a logarithmic factor from the previous bound and bounds the failure probability by a negative power of an absolute constant.