Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions — mentioned by y7

Sun, 16 Aug 2020 10:02:52 GMT

The conjecture by Erdős is the following: if A ⊂ ℕ is such that Σ_{n ∈ A} 1/n diverges, then A contains arbitrarily long arithmetic progressions. Bloom and Sisask now proved that A contains infinitely many length-3 arithmetic progressions, following from their main result which is an improved upper bound for Roth's theorem. https://arxiv.org/abs/2007.03528

Paper and discussion history. A mention is not an endorsement.

Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions · HackerPapers discussions

Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions — mentioned by y7