‘Huge Breakthrough’ in the Math of Imbalance
For the first time in 30 years, computer scientists have found a better way to allocate objects evenly between two groups. The post ‘Huge Breakthrough’ in the Math of Imbalance first appeared on Quanta Magazine
Balancing traits among groups of individuals becomes increasingly difficult when trying to evenly distribute their skills and knowledge. Combinatorial discrepancy theory, a branch of mathematics, aims to allocate resources as evenly as possible. One trivia team receiving all historical knowledge while others receive none represents a significant discrepancy.
In the 1980s, mathematician János Komlós predicted that no matter the number of objects or dimensions considered, the discrepancy would never exceed a constant amount. Despite the conjecture seeming absurd, no one has proven it false. Its creator himself once joked about creating a "wrench" in the field of combinatorial discrepancy theory.
Proving the conjecture has been considered a "holy-grail problem in discrepancy theory." In 2025, researchers Haotian Jiang and Nikhil Bansal made significant headway by finding a limit that changes so slowly with the dimension, making it nearly constant. This breakthrough offers a more compelling argument that Komlós' conjecture may be true, with potential applications in math, physics, and machine learning.
Written by urgent.news from Quanta Magazine's reporting — not their text. Machine-written — may contain errors; check the original before relying on it.
