The upper logarithmic density of monochromatic subset sums
From MaRDI portal
Publication:6074983
Abstract: We show that in any two-coloring of the positive integers there is a color for which the set of positive integers that can be represented as a sum of distinct elements with this color has upper logarithmic density at least and this is best possible. This answers a forty-year-old question of ErdH{o}s.
Recommendations
- scientific article; zbMATH DE number 4089601
- On the density of sumsets
- On the distribution of monochromatic complete subgraphs and arithmetic progressions
- On the maximal density of sum-free sets
- Sure monochromatic subset sums
- Discrepancy and large dense monochromatic subsets
- Über die asymptotische Dichte gewisser Teilmengen der natürlichen Zahlen
- Asymptotically tight bounds on subset sums
- A probabilistic threshold for monochromatic arithmetic progressions
- On the Density of Universal Sum-Free Sets
Cites work
- scientific article; zbMATH DE number 3897011 (Why is no real title available?)
- scientific article; zbMATH DE number 3760250 (Why is no real title available?)
- scientific article; zbMATH DE number 3784967 (Why is no real title available?)
- Complete sequences of polynomial values
- Long arithmetic progressions in sumsets: Thresholds and bounds
- The Erdös discrepancy problem
- The logarithmically averaged Chowla and Elliott conjectures for two-point correlations
This page was built for publication: The upper logarithmic density of monochromatic subset sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074983)