ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be a positive integer. Let π\pi be a permutation of length kk, let n=1000k2n=1000k^2, and let σ\sigma be a uniformly random permutation of length nn. Containment probability conjecture. The probability that σ\sigma does not contain π\pi satisfies

Pr⁡(π∉σ)≤exp⁡(−k3/2+o(1)).\Pr(\pi\notin\sigma)\leq \exp\bigl(-k^{3/2+o(1)}\bigr).

This would imply that a typical permutation of length 1000k21000k^2 is kk-universal. The paper gives supporting bounds for very quasirandom and highly structured patterns, while hybrid patterns remain the main obstacle.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.