The Erdős–Moser Sum-free Set Problem
From MaRDI portal
Publication:5146202
DOI10.4153/S0008414X1900049XzbMath1466.11068arXiv1804.03356MaRDI QIDQ5146202
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
Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- Near optimal bounds in Freiman's theorem
- A probabilistic technique for finding almost-periods of convolutions
- Linear equations in primes
- An improved construction of progression-free sets
- On triples in arithmetic progression
- Counting sets with small sumset, and the clique number of random Cayley graphs
- A quantitative version of the idempotent theorem in harmonic analysis
- Sum-free sets in groups: a survey
- Finite field models in arithmetic combinatorics -- ten years on
- On a question of Erdős and Moser
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Sum-avoiding subsets
- Sum-avoiding sets in groups
- On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
- A Note on Elkin’s Improvement of Behrend’s Construction
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- On sets of large trigonometric sums
- Sums of Dilates
- On the Littlewood Problem Modulo a Prime
- Probabilistic construction of small strongly sum-free sets via large Sidon sets
- Finding Linear Patterns of Complexity One
- On a problem of Gowers
- AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
- On a Combinatorial Problem in Number Theory
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Arithmetic progressions in sumsets
This page was built for publication: The Erdős–Moser Sum-free Set Problem
