ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

XP=∑j∈Ixj.X_P=\sum_{j\in\mathbb{I}}x_j.

For i∈[n−1]i\in[n-1], let Hi∼Hyp⁡(n,i,k)H_i\sim\operatorname{Hyp}(n,i,k) be a hypergeometric random variable.

Aydinian–Blinovsky refinement. For every k∈[n−1]k\in[n-1] and every P∈NnP\in\mathcal{N}_n,

P(XP≥0)≥min⁡i∈[n−1]P(Hi≥ikn).\mathbb{P}(X_P\ge 0)\ge\min_{i\in[n-1]}\mathbb{P}\left(H_i\ge\frac{ik}{n}\right).

This refines the MMS conjecture and is stated to cover all non-trivial parameter instances. The source gives no resolution status for the refinement, so it is recorded as open.

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.