An improved construction of progression-free sets

DOI10.1007/s11856-011-0061-1zbMath1280.11008arXiv0801.4310WikidataQ56341557 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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

11B05: Density, gaps, topology

11B25: Arithmetic progressions

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, Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses, New Results on Linear Size Distance Preservers, 3SUM, 3XOR, triangles, On certain other sets of integers, Unique sequences containing no \(k\)-term arithmetic progressions, Nearly equal distances in metric spaces, The NOF multiparty communication complexity of composed functions, Enumerating solution-free sets in the integers, Extremal Betti numbers of Vietoris-Rips complexes, On Roth's theorem on progressions, Injective colorings with arithmetic constraints, Novel structures in Stanley sequences, Arithmetic progressions in multiplicative groups of finite fields, 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, Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching, A note on multiparty communication complexity and the Hales-Jewett theorem, Coloring the cube with rainbow cycles, Caps and progression-free sets in \(\mathbb{Z}_m^n\), Roth's theorem in many variables, Improved bound in Roth's theorem on arithmetic progressions, An improved lower bound related to the Furstenberg-Sárközy theorem, On solution-free sets of integers, Sunflowers and testing triangle-freeness of functions, 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, Some Properties of Lower Level-Sets of Convolutions, Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item