ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be a positive integer and let Sn\mathcal{S}_n be the set of permutations of [n][n]. A permutation is kk-universal if it contains every pattern in Sk\mathcal{S}_k. For fixed ε>0\varepsilon>0, consider a uniformly random permutation of length (1+ε)k2/4(1+\varepsilon)k^2/4. Alon's universality conjecture. With high probability, it is kk-universal. Here, with high probability means with probability 1−o(1)1-o(1) as k→∞k\to\infty. The conjecture predicts the asymptotically sharp threshold for a random permutation to contain all patterns of length kk; the paper proves universality for substantially larger lengths but leaves this asymptotic threshold open.

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.