Random-set Szemerédi threshold conjecture
For , let denote the random subset of obtained by selecting each integer independently with probability . A set is -Szemerédi if every subset of of cardinality at least contains an arithmetic progression of length .
Random-set Szemerédi threshold conjecture. For every and every integer , there exist positive constants and such that
The conjecture asserts that the natural obstruction gives the sharp threshold, improving substantially on the range obtained from Green–Tao pseudorandomness methods.
References
Status
- Solved: David Conlon and William T. Gowers. Combinatorial theorems in sparse random sets (Annals of Mathematics, 2016) https://doi.org/10.4007/annals.2016.184.2.2
Source: D. Conlon and W. T. Gowers, “Combinatorial theorems in sparse random sets”, arXiv:1011.4310 (2015).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.