On a question of Erdős and Moser
From MaRDI portal
Publication:2566606
DOI10.1215/S0012-7094-04-12915-XzbMath1155.11346OpenAlexW2000040997MaRDI QIDQ2566606
Publication date: 26 September 2005
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1215/s0012-7094-04-12915-x
Extremal set theory (05D05) Other combinatorial number theory (11B75) Inverse problems of additive number theory, including sumsets (11P70)
Related Items (20)
Approximate groups and doubling metrics ⋮ Product set estimates for non-commutative groups ⋮ New bounds in Balog-Szemerédi-Gowers theorem ⋮ On sets defining few ordinary lines ⋮ A question of Bukh on sums of dilates ⋮ On the diameter of permutation groups. ⋮ Arithmetic combinatorics on Vinogradov systems ⋮ The Erdős–Moser Sum-free Set Problem ⋮ On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs ⋮ Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. ⋮ Sums and products along sparse graphs ⋮ Near optimal bounds in Freiman's theorem ⋮ Decomposition of random walk measures on the one-dimensional torus ⋮ Sum-avoiding sets in groups ⋮ Monochromatic sums and products ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets ⋮ Products of Differences over Arbitrary Finite Fields ⋮ Growth in groups: ideas and perspectives ⋮ Exponential sum estimates over a subgroup in an arbitrary finite field
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Generalized arithmetical progressions and sumsets
- A statistical theorem of set addition
- A polynomial bound in Freiman's theorem.
- Finite and infinite arithmetic progressions in sumsets
- Sum-avoiding subsets
- On sets of integers containing k elements in arithmetic progression
- Probabilistic construction of small strongly sum-free sets via large Sidon sets
- On a Combinatorial Problem in Number Theory
- A new proof of Szemerédi's theorem
This page was built for publication: On a question of Erdős and Moser
