‘Huge Breakthrough’ in the Math of Imbalance
Summary
Quanta Magazine reports a breakthrough in discrepancy theory: computer scientists Bansal and Jiang improved the bound on Komlós' conjecture with a new algorithm that reduces potential imbalance to about log(N)^(1/4), bringing the problem closer to a constant bound. The work introduces a notion of dependency and shows the algorithm is efficient, with potential implications for optimization, physics, and machine learning.