What's up in
Daniel Spielman solves important problems by thinking hard — about other questions.
Using ideas borrowed from graph theory, two mathematicians have shown that extremely complex surfaces are easy to traverse.
The existence of secure cryptography depends on one of the oldest questions in computational complexity.
A new paper shows how to create longer disordered strings than mathematicians had thought possible, proving that a well-known recent conjecture is “spectacularly wrong.”
By carefully constructing a multidimensional and well-connected graph, a team of researchers has finally created a long-sought locally testable code that can immediately betray whether it’s been corrupted.
Get highlights of the most important news delivered to your email inbox