Each problem states how progress is verified and what counts as a contribution. Besides the problems curated here, the catalogue includes open conjectures from Formal Conjectures (with Lean statements), optimization constants and the AlphaEvolve problems. Know one that belongs here? Propose a problem.
3 shown
Construct explicit n×n matrices that stay high-rank even after many entry changes, with parameters strong enough for Valiant's circuit lower bounds. Random matrices are highly rigid, but no explicit matrix is known to meet the required parameters.
Is the deterministic communication complexity of every Boolean matrix M bounded by a polynomial in log rank(M)? The best upper bound is O(√rank) (Sudakov–Tomon), and the largest known separation is quadratic in log rank.
Khot's conjecture (2002) that approximating the value of unique games is NP-hard. Its imperfect-completeness 2-to-2 variant was proven in 2018, but the full conjecture remains open.
