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.
Researchers are one step closer to injecting probability into deterministic machines.
Readers’ modifications of a bean machine showed how deterministic laws are capable of producing random-seeming behavior.
Mathematicians have figured out exactly how many moves it takes to randomize a 15 puzzle.
Playing with a simple bean machine illustrates how deterministic laws can produce probabilistic, random-seeming behavior.