Note on the Theorem of Balog, Szemer\'edi, and Gowers
Combinatorics
2024-10-08 v2 Number Theory
Abstract
We prove that every additive set with energy has a subset of size such that . This is, essentially, the largest structured set one can get in the Balog-Szemer\'edi-Gowers theorem.
Keywords
Cite
@article{arxiv.2308.10245,
title = {Note on the Theorem of Balog, Szemer\'edi, and Gowers},
author = {Christian Reiher and Tomasz Schoen},
journal= {arXiv preprint arXiv:2308.10245},
year = {2024}
}
Comments
second version addresses referee reports