Maximization conjecture for nonnegative signed permutation paths
Statement
For , define
Thus consists of signed permutations whose partial sums are nonnegative. The maximization conjecture. The quantity is maximized when .
Equivalently, the simple symmetric random walk should have the highest probability of staying nonnegative among random processes with exchangeable increments 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.