RT Timothy Gowers @wtgowers: Another major problem, this time in additive combinatorics, has fallen, this time to humans rather than AI, but using met...
A new paper by Thomas Bloom, Will Sawin, Carl Schildkraut and Dmitrii Zhelezov disproves a well-known conjecture in additive combinatorics. The result shows there exist arbitrarily large finite sets A of real numbers where max(|A+A|,|AA|) ≤ |A|^{2-c}. The solution was achieved by humans using methods related to an earlier AI solution to the unit distance conjecture.