ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SnS_n be the symmetric group, let X1,X2,…,Xn−1X_1,X_2,\ldots,X_{n-1} be independent identically distributed random variables, and let p(X1,X2,…,Xn−1)p(X_1,X_2,\ldots,X_{n-1}) denote the permutation pattern associated with their outcomes. Let ∼\sim be the equivalence relation on permutations defined by valid flips. Random-walk pattern probability characterization conjecture. For π,τ∈Sn\pi,\tau\in S_n, one has

P(p(X1,X2,…,Xn−1)=π)=P(p(X1,X2,…,Xn−1)=τ)\mathbb{P}(p(X_1,X_2,\ldots,X_{n-1})=\pi)=\mathbb{P}(p(X_1,X_2,\ldots,X_{n-1})=\tau)

for every probability distribution on the i.i.d. random variables X1,X2,…,Xn−1X_1,X_2,\ldots,X_{n-1} if and only if π∼τ\pi\sim\tau. 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 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.