ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For x∈R>0nx\in \mathbb{R}_{>0}^n, define

A(x)={(σ,s):σ∈Sn, s∈{−1,1}n, ∑i=1ksixσ(i)≥0 for all k∈[n]}.A(x)=\big\{(\sigma,s):\sigma\in S_n,\ s\in\{-1,1\}^n,\ \sum_{i=1}^k s_i x_{\sigma(i)}\ge 0\ \text{for all }k\in[n]\big\}.

Thus A(x)A(x) consists of signed permutations whose partial sums are nonnegative. The maximization conjecture. The quantity ∣A(x)∣|A(x)| is maximized when x1=⋯=xnx_1=\dots=x_n.

Equivalently, the simple symmetric random walk should have the highest probability of staying nonnegative among random processes with exchangeable increments (X1,…,Xn)∈(R\{0})n(X_1,\dots,X_n)\in(\mathbb{R}\backslash\{0\})^n whose law is invariant under sign changes of the elements. The source explains that this would yield useful probability bounds and a direct proof of the main asymptotic, but gives no resolution.

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.