What's up in
In just three pages, a Russian mathematician has presented a better way to color certain types of networks than many experts thought possible.
The universe of problems that a computer can check has grown. The researchers’ secret ingredient? Quantum entanglement.
In math, sometimes the most common things are the hardest to find.
The nearest neighbor problem asks where a new point fits into an existing data set. A few researchers set out to prove that there was no universal way to solve it. Instead, they found such a way.
The latest in a new series of proofs brings theoretical computer scientists within striking distance of one of the great conjectures of their discipline.
By making the first progress on the “chromatic number of the plane” problem in over 60 years, an anti-aging pundit has achieved mathematical immortality.