加载中…
Freiman’s 2.4-Theorem states that any set satisfying and can be covered by an arithmetic progression of length at most . A more general result of Green and Ruzsa implies that this covering property holds for any set satisfying as long as the rather strong density requirement $|A| < p/10^{215}$ is satisfied. We present a version of this statement that allows for sets satisfying with the more modest density requirement of .

生成讲解博客的中文版本

生成AI智能校验的中文版本