Rump's 100 Euro Conjecture for matrices

Less than 1 year old · traced to

Let A∈Rn×nA\in\mathbb{R}^{n\times n}, let e=(1,…,1)T∈Rne=(1,\dots,1)^T\in\mathbb{R}^n be the all-ones vector, and write ∣A∣|A| for the entrywise absolute value of AA. Suppose that

∣A∣e=ne.|A|e=ne.

Rump's 100 Euro Conjecture. There exists x∈Rn∖{0}x\in\mathbb{R}^n\setminus\{0\} such that

∣Ax∣≥∣x∣.|Ax|\ge |x|.

The condition means that every row of AA lies on the boundary of the ℓ1\ell_1-ball of radius nn. The paper's abstract says that this conjecture is confirmed using a finite-dimensional reformulation of Ball's plank theorem, so its status is solved.

References

Primary source

Teng Zhang, “Plank theorems, Gaussian probabilistic estimates and Rump's 100 Euro conjecture”, arXiv:2603.07423 (2026).

Progress summary

Refreshed
Claimed solved

A March 2026 paper claims to prove the conjecture, but the proof has not been independently verified.

Rump posed the conjecture in 1997: every real matrix whose rows have absolute-value sum nn should expand some nonzero vector coordinatewise in absolute value. The retrieved paper claims this statement is true.

Known results

  • Rump, 1997: every admissible matrix has some nonzero xx satisfying ∣Ax∣≥13+22∣x∣|Ax|\ge \frac{1}{3+2\sqrt{2}}|x|.

March 8, 2026 claimed proof

On March 8, 2026, Plank theorems, Gaussian probabilistic estimates and Rump’s 100 Euro conjecture claimed a stronger cube-escape theorem: if every row has ell1ell_1-norm at least ntnt, then some x∈[−1,1]nx\in[-1,1]^n satisfies ∣Ax∣≥te≥t∣x∣|Ax|\ge t e\ge t|x|. Taking t=1t=1 yields the conjecture. This is a claimed proof and remains unverified.

Current status (as of September 2026): A March 2026 preprint claims to settle the conjecture via Ball’s plank theorem, but the claim remains unverified.

Sources

Solutions 0

No solutions have been posted yet.