The K51ml\f3s discrepancy conjecture
For a square matrix , define its discrepancy by
K51ml\f3s conjecture. There exists a universal constant such that every square matrix whose columns have unit norm satisfies
This conjecture is a vector-balancing strengthening of discrepancy bounds for matrices. It remains open; the best cited lower bound on the possible value of is .
References
Primary source
Afonso S. Bandeira, Anastasia Kireeva, Antoine Maillard and Almut Rödder, “Randomstrasse101: Open Problems of 2024”, arXiv:2504.20539 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.