The random-walk pattern probability characterization conjecture
Statement
Let be the symmetric group, let be independent identically distributed random variables, and let denote the permutation pattern associated with their outcomes. Let be the equivalence relation on permutations defined by valid flips. Random-walk pattern probability characterization conjecture. For , one has
for every probability distribution on the i.i.d. random variables if and only if . The preceding results characterize the equivalence classes using valid flips; the conjecture asserts that these classes are exactly the classes of permutations having equal occurrence probabilities for every step distribution, and the authors state that they are working on a proof.
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.