What's up in
Two new approaches allow deep neural networks to solve entire families of partial differential equations, making it easier to model complicated systems and to do so orders of magnitude faster.
Inside the symmetries of a crystal shape, a postdoctoral researcher has unearthed a counterexample to a basic conjecture about multiplicative inverses.
Fifty years ago, Paul Erdős and two other mathematicians came up with a graph theory problem that they thought they might solve on the spot. A team of mathematicians has finally settled it.
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.
Readers used their Zen-like puzzle solving skills to discover hidden insights.
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.
Most modeling efforts during the COVID-19 pandemic have sought to address urgent practical concerns. But some groups aim to bolster the theoretical underpinnings of that work instead.
Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields.