On a question of Erdős and Moser

DOI10.1215/S0012-7094-04-12915-XMaRDI QIDQ2566606zbMATH OpenOpenAlexFDO

Authors Benny Sudakov, Van Vu, Endre Szemerédi

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

Mathematics Subject Classification ID

Extremal set theory (05D05) Other combinatorial number theory (11B75) Inverse problems of additive number theory, including sumsets (11P70)

Recommendations

• The Erdős-Moser sum-free set problem
• Publication:4941832
• Sets of integers with no large sum-free subset
• Estimates related to sumfree subsets of sets of integers
• On the maximal density of sum-free sets

Cites work

• A new proof of Szemerédi's theorem
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• A polynomial bound in Freiman's theorem.
• A statistical theorem of set addition
• Finite and infinite arithmetic progressions in sumsets
• Generalized arithmetical progressions and sumsets
• scientific article; zbMATH DE number 3834055 (Why is no real title available?)
• scientific article; zbMATH DE number 3425719 (Why is no real title available?)
• scientific article; zbMATH DE number 683826 (Why is no real title available?)
• scientific article; zbMATH DE number 933467 (Why is no real title available?)
• scientific article; zbMATH DE number 3232871 (Why is no real title available?)
• On a Combinatorial Problem in Number Theory
• On sets of integers containing k elements in arithmetic progression
• Probabilistic construction of small strongly sum-free sets via large Sidon sets
• Sum-avoiding subsets

Cited in

(26)

• Sums and products along sparse graphs
• Exponential sum estimates over a subgroup in an arbitrary finite field
• Product set estimates for non-commutative groups
• New bounds in Balog-Szemerédi-Gowers theorem
• On the diameter of permutation groups.
• 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
• Approximate groups and doubling metrics
• Arithmetic combinatorics on Vinogradov systems
• A question of Bukh on sums of dilates
• An improved upper bound for the sum-free subset constant
• On sets defining few ordinary lines
• Questions Related to the Erdös-Turan Conjecture
• Products of differences over arbitrary finite fields
• scientific article; zbMATH DE number 1418272 (Why is no real title available?)
• Decomposition of random walk measures on the one-dimensional torus
• The Erdős-Moser sum-free set problem
• Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.
• Growth in groups: ideas and perspectives
• Near optimal bounds in Freiman's theorem
• On divisibility properties of integers of the form \(ab+1\)
• Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics
• Energy estimates in sum-product and convexity problems
• On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs

This page was built for publication: On a question of Erdős and Moser

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