Containment probability conjecture for random permutations
Statement
Let be a positive integer. Let be a permutation of length , let , and let be a uniformly random permutation of length . Containment probability conjecture. The probability that does not contain satisfies
This would imply that a typical permutation of length is -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.