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.

A group of MIT undergraduates is searching for tetrahedra that tile space, the latest effort in a millennia-long inquiry. They’ve already made a new discovery.

Four mathematicians have cataloged all the tetrahedra with rational angles, resolving a question about basic geometric shapes using techniques from number theory.

Lauren Williams has charted an adventurous mathematical career out of the pieces of a fundamental object called the positive Grassmannian.

At 21, Ashwin Sah has produced a body of work that senior mathematicians say is nearly unprecedented for a college student.

For almost a century, the anonymous members of Nicolas Bourbaki have written books intended as pure expressions of mathematical thought.

David Conlon and Asaf Ferber have raised the lower bound for multicolor “Ramsey numbers,” which quantify how big graphs can get before patterns inevitably emerge.

Previous