The Erdős-Moser sum-free set problem

DOI10.4153/S0008414X1900049XzbMATH Open1466.11068arXiv1804.03356MaRDI QIDQ5146202FDOQ5146202

Publication date: 25 January 2021

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

Abstract: We show that if A is a finite set of integers then it has a subset S of size log^{1+c} |A| (c>0 absolute) such that s+s' is never in A when s and s' are distinct elements of S.

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

Recommendations

On a question of Erdős and Moser
Sets of integers with no large sum-free subset
scientific article; zbMATH DE number 2095511
Generalized sum-free subsets
scientific article; zbMATH DE number 409908

zbMATH Keywords

additive energy Freiman's theorem sum-free summing hereditarily energetic

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70)

Cites Work

Additive combinatorics
On triples in arithmetic progression
Title not available (Why is that?)
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
Linear equations in primes
A Szemerédi-type regularity lemma in abelian groups, with applications
A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
Counting sets with small sumset, and the clique number of random Cayley graphs
Sum-avoiding sets in groups
On the Littlewood Problem Modulo a Prime
A note on Elkin's improvement of Behrend's construction
On sets of large trigonometric sums
AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
On a question of Erdős and Moser
Finite field models in additive combinatorics
Title not available (Why is that?)
Sums of Dilates
Arithmetic progressions in sumsets
A probabilistic technique for finding almost-periods of convolutions
On a problem of Gowers
Progression-free sets in $\mathbb{Z}_4^n$ are exponentially small
Near optimal bounds in Freiman's theorem
A quantitative version of the idempotent theorem in harmonic analysis
Sum-avoiding subsets
Finite field models in arithmetic combinatorics -- ten years on
Sum-free sets in groups: a survey
Probabilistic construction of small strongly sum-free sets via large Sidon sets
Title not available (Why is that?)
On a Combinatorial Problem in Number Theory
On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
Finding linear patterns of complexity one

Cited In (3)

On a question of Erdős and Moser
Sum-avoiding sets in groups
The Typical Approximate Structure of Sets with Bounded Sumset

This page was built for publication: The Erdős-Moser sum-free set problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146202)