Tag Archives: Ben Green

To cheer you up in difficult times 20: Ben Green presents super-polynomial lower bounds for off-diagonal van der Waerden numbers W(3,k)

What will be the next polymath project? click here for our post about it.  New lower bounds for van der Waerden numbers by Ben Green Abstract: We show that there is a red-blue colouring of [N] with no blue 3-term … Continue reading

Posted in Combinatorics, Number theory | Tagged , | 2 Comments

The AC0 Prime Number Conjecture

Möbius randomness and computational complexity Last spring Peter Sarnak gave a thought-provoking lecture in Jerusalem. (Here are the very interesting slides of a similar lecture at I.A.S.) Here is a variation of the type of questions Peter has raised. The Prime … Continue reading

Posted in Computer Science and Optimization, Number theory | Tagged , , , , , , , | 15 Comments