ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix integers n≥2n\ge 2 and k<nk<n. Let Nn\mathcal{N}_n be the family of multisets P={x1,…,xn}P=\{x_1,\ldots,x_n\} of real numbers satisfying ∑i=1nxi=0\sum_{i=1}^n x_i=0. Choose I∈([n]k)\mathbb{I}\in\binom{[n]}{k} uniformly at random and define

XP=∑i∈Ixi.X_P=\sum_{i\in\mathbb{I}}x_i.

MMS conjecture. If n≥4kn\ge 4k, then for every P∈NnP\in\mathcal{N}_n,

P(XP≥0)≥kn.\mathbb{P}(X_P\ge 0)\ge \frac{k}{n}.

The bound is sharp for the population consisting of one element equal to 11 and n−1n-1 elements equal to −1/(n−1)-1/(n-1). The conjecture is open in general; the best stated upper bound in the source is Nk≤1046kN_k\le 10^{46}k, where NkN_k is the least integer such that the inequality holds for all n≥Nkn\ge N_k and all P∈NnP\in\mathcal{N}_n.

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.