An improved construction of progression-free sets

DOI10.1007/s11856-011-0061-1zbMath1280.11008arXiv0801.4310OpenAlexW3138287827WikidataQ56341557 ScholiaQ56341557MaRDI QIDQ1758902

Michael Elkin

Publication date: 19 November 2012

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Density, gaps, topology (11B05) Arithmetic progressions (11B25)

Related Items

A blurred view of Van der Waerden type theorems ⋮ Some Properties of Lower Level-Sets of Convolutions ⋮ The equidistant dimension of graphs ⋮ The number of \(k\)-dimensional corner-free subsets of grids ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ On certain other sets of integers ⋮ On solution-free sets of integers ⋮ Sunflowers and testing triangle-freeness of functions ⋮ New lower bounds for van der Waerden numbers ⋮ Unique sequences containing no \(k\)-term arithmetic progressions ⋮ Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols ⋮ Arithmetic progressions in multiplicative groups of finite fields ⋮ Nearly equal distances in metric spaces ⋮ Tower-type bounds for Roth's theorem with popular differences ⋮ Four‐term progression free sets with three‐term progressions in all large subsets ⋮ Reachability Preservers: New Extremal Bounds and Approximation Algorithms ⋮ Injective colorings with arithmetic constraints ⋮ Novel structures in Stanley sequences ⋮ On classification of sequences containing arbitrarily long arithmetic progressions ⋮ 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 ⋮ The NOF multiparty communication complexity of composed functions ⋮ 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 ⋮ Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching ⋮ Caps and progression-free sets in \(\mathbb{Z}_m^n\) ⋮ Extremal Betti numbers of Vietoris-Rips complexes ⋮ Roth's theorem in many variables ⋮ Unnamed Item ⋮ 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 ⋮ New Results on Linear Size Distance Preservers ⋮ 3SUM, 3XOR, triangles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding large 3-free sets. I. The small \(n\) case
• Roth's theorem on progressions revisited
• On the Erdős-Straus non-averaging set problem
• Extremal problems on non-averaging and non-dividing sets
• The convex hull of the integer points in a large ball
• An improved construction of progression-free sets
• On the lower estimation of non-averaging sets
• On triples in arithmetic progression
• A Note on Elkin’s Improvement of Behrend’s Construction
• Solving a linear equation in a set of integers I
• Über die Classenzahl quadratischer Zahlkörper
• Behrend-type constructions for sets of linear equations
• A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
• On Some Sequences of Integers
• On Non-Averaging Sets of Integers
• On Certain Sets of Integers
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression

This page was built for publication: An improved construction of progression-free sets