A Note on Elkin’s Improvement of Behrend’s Construction
From MaRDI portal
Publication:2996309
DOI10.1007/978-0-387-68361-4_9zbMath1261.11013arXiv0810.0732OpenAlexW1596624097WikidataQ56341558 ScholiaQ56341558MaRDI QIDQ2996309
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
Other combinatorial number theory (11B75) Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items
On an almost all version of the Balog-Szemeredi-Gowers theorem ⋮ A blurred view of Van der Waerden type theorems ⋮ On the power of random greedy algorithms ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ On certain other sets of integers ⋮ On solution-free sets of integers ⋮ New lower bounds for van der Waerden numbers ⋮ Tower-type bounds for Roth's theorem with popular differences ⋮ Four‐term progression free sets with three‐term progressions in all large subsets ⋮ Novel structures in Stanley sequences ⋮ The Kelley-Meka bounds for sets free of three-term arithmetic progressions ⋮ Lower bounds for the Turán densities of daisies ⋮ NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR ⋮ Threshold functions and Poisson convergence for systems of equations in random sets ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ On Roth's theorem on progressions ⋮ Coloring the cube with rainbow cycles ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The Erdős–Moser Sum-free Set Problem ⋮ Enumerating solution-free sets in the integers ⋮ On the complexity of finding and counting solution-free sets of integers ⋮ Star Chromatic Index ⋮ An improved construction of progression-free sets ⋮ An improved lower bound related to the Furstenberg-Sárközy theorem ⋮ ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS ⋮ Finite field models in arithmetic combinatorics -- ten years on ⋮ Improved bound in Roth's theorem on arithmetic progressions ⋮ A note on multiparty communication complexity and the Hales-Jewett theorem ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
