What's up in
The Computer Scientist Who Finds Life Lessons in Games
In Shang-Hua Teng’s work, theoretical and practical questions have long been intertwined. Now he’s turning his focus to the impractical.
Finally, a Fast Algorithm for Shortest Paths on Negative Graphs
Researchers can now find the shortest route through a network nearly as fast as theoretically possible, even when some steps can cancel out others.
Hypergraphs Reveal Solution to 50-Year-Old Problem
In 1973, Paul Erdős asked if it was possible to assemble sets of “triples” — three points on a graph — so that they abide by two seemingly incompatible rules. A new proof shows it can always be done.
He Dropped Out to Become a Poet. Now He’s Won a Fields Medal.
June Huh wasn’t interested in mathematics until a chance encounter during his sixth year of college. Now his profound insights connecting combinatorics and geometry have led to math’s highest honor.
Mathematical Connect-the-Dots Reveals How Structure Emerges
A new proof identifies precisely how large a mathematical graph must be before it contains a regular substructure.
Researchers Achieve ‘Absurdly Fast’ Algorithm for Network Flow
Computer scientists can now solve a decades-old problem in practically the time it takes to write it down.
Unimaginable Surfaces Discovered After Decades-Long Search
Using ideas borrowed from graph theory, two mathematicians have shown that extremely complex surfaces are easy to traverse.
Elegant Six-Page Proof Reveals the Emergence of Random Structure
Two young mathematicians have astonished their colleagues with a full proof of the Kahn-Kalai conjecture — a sweeping statement about how structure emerges in random sets and graphs.