What's up in
Inside the symmetries of a crystal shape, a postdoctoral researcher has unearthed a counterexample to a basic conjecture about multiplicative inverses.
Rediet Abebe uses the tools of theoretical computer science to understand pressing social problems — and try to fix them.
Despite finding no specific examples, researchers have proved the existence of a pervasive kind of prime number so delicate that changing any of its infinite digits renders it composite.
A recent paper set the fastest record for multiplying two matrices. But it also marks the end of the line for a method researchers have relied on for decades to make improvements.
Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields.
By harnessing randomness, a new algorithm achieves a fundamentally novel — and faster — way of performing one of the most basic computations in math and computer science.