A Note on Elkin’s Improvement of Behrend’s Construction

DOI10.1007/978-0-387-68361-4_9zbMath1261.11013arXiv0810.0732WikidataQ56341558 ScholiaQ56341558MaRDI QIDQ2996309

Julia Wolf, Ben Green

Publication date: 6 May 2011

Published in: Additive Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0810.0732

zbMATH Keywords

Roth's theorem; arithmetic progression; three term progression free subset

Mathematics Subject Classification ID

11B75: Other combinatorial number theory

11B25: Arithmetic progressions

11B30: Arithmetic combinatorics; higher degree uniformity

Related Items

New applications of the polynomial method: The cap set conjecture and beyond, NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR, Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, Star Chromatic Index, The Erdős–Moser Sum-free Set Problem, On an almost all version of the Balog-Szemeredi-Gowers theorem, Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses, On certain other sets of integers, Enumerating solution-free sets in the integers, On Roth's theorem on progressions, Novel structures in Stanley sequences, Threshold functions and Poisson convergence for systems of equations in random sets, On the complexity of finding and counting solution-free sets of integers, An improved construction of progression-free sets, A note on multiparty communication complexity and the Hales-Jewett theorem, Coloring the cube with rainbow cycles, An improved lower bound related to the Furstenberg-Sárközy theorem, On solution-free sets of integers, Finite field models in arithmetic combinatorics -- ten years on, ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, Embedding Graphs into Larger Graphs: Results, Methods, and Problems