Scientific News Report
๐๐๐ฃ๐จ๐ซ ๐๐๐ญ๐ก๐๐ฆ๐๐ญ๐ข๐๐๐ฅ ๐๐ซ๐๐๐ค๐ญ๐ก๐ซ๐จ๐ฎ๐ ๐ก ๐๐ซ๐ข๐ง๐ ๐ฌ ๐๐๐๐๐๐๐ฌ-๐๐ฅ๐ ๐๐ฆ๐๐๐ฅ๐๐ง๐๐ ๐๐ซ๐จ๐๐ฅ๐๐ฆ ๐๐ฅ๐จ๐ฌ๐๐ซ ๐ญ๐จ ๐๐จ๐ฅ๐ฎ๐ญ๐ข๐จ๐ง
Computer scientists have achieved the first major improvement in nearly 30 years on a fundamental mathematical problem concerning how objects can be divided as evenly as possible between two groups. The breakthrough, by theoretical computer scientists Nikhil Bansal and Haotian Jiang, advances the study of the Komlรณs conjecture, one of the central unresolved questions in combinatorial discrepancy theory. Their new algorithm dramatically improves the best-known mathematical guarantee for balancing high-dimensional collections of objects. Although it does not completely prove the Komlรณs conjecture, researchers say the result provides some of the strongest evidence yet that the decades-old prediction may ultimately be correct.
Read report
