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 (2+sqrt3)/4 and this is best possible. This answers a forty-year-old question of ErdH{o}s.









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)