Fixed-pattern containment conjecture at the universality threshold
Statement
Let denote the permutations of . Fix and set . For , let be a uniformly random permutation of length . Fixed-pattern containment conjecture. With high probability, contains . The statement is a weakening of Alon's universality conjecture because it fixes one pattern rather than requiring simultaneous containment of every pattern in . The source explicitly describes it as an apparently open problem.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.