What's up in
Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.
A powerful technique called SAT solving could work on the notorious Collatz conjecture. But it’s a long shot.
Two mathematicians have proved the first leg of Paul Erdős’ all-time favorite problem about number patterns.
A major advance toward solving the 60-year-old sunflower conjecture is shedding light on how order begins to appear as random systems grow in size.
The “sensitivity” conjecture stumped many top computer scientists, yet the new proof is so simple that one researcher summed it up in a single tweet.