Structural studies of the robust material called sporopollenin reveal how it made plants hardy enough to reproduce on dry land.

Three computer scientists have posted a proof of the NLTS conjecture, showing that systems of entangled particles can remain difficult to analyze even away from extremes.

In 1973, Paul Erdős asked if it was possible to assemble sets of “triples” — three points on a graph — so that they abide by two seemingly incompatible rules. A new proof shows it can always be done.

What makes a proof stronger than a guess? What does evidence look like in the realm of mathematical abstraction? Hear the mathematician Melanie Matchett Wood explain how probability helps to guide number theorists toward certainty.

Surprising as it may sound, 107 years after the introduction of general relativity, the meanings of basic concepts are still being worked out.

Patterns that guide the development of feathers and other features can be set by mechanical forces in the embryo, not just by gradients of chemicals.

Computer scientists have found a new type of problem that quantum computers can solve dramatically faster than their classical counterparts.

Mark Braverman has spent his career translating thorny problems into the language of information complexity.

On his way to winning a Fields Medal, James Maynard has cut a path through simple-sounding questions about prime numbers that have stumped mathematicians for centuries.