The Erdős-Moser sum-free set problem

DOI10.4153/S0008414X1900049XMaRDI QIDQ5146202zbMATH OpenFDO

Authors Tom Sanders

Publication date 25 January 2021

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

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

zbMATH Keywords

additive energyFreiman's theoremsum-freesumminghereditarily energetic

Mathematics Subject Classification ID

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

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.

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

Cites work

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

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)