On an almost all version of the Balog-Szemeredi-Gowers theorem
arXiv:1811.10707
Abstract
We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemerédi-Gowers theorem: For any and , there exists such that the following statement holds: if for some , then there is a subset with such that . We also discuss issues around quantitative bounds in this statement, in particular showing that when the dependence of on cannot be polynomial for any fixed .
18 pages