The upper logarithmic density of monochromatic subset sums

DOI10.1112/MTK.12167arXiv2105.15195OpenAlexW3166409534MaRDI QIDQ6074983FDOQ6074983

Authors: David Conlon, Jacob Fox 

Publication date: 20 September 2023

Published in: Mathematika (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2105.15195

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

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30)

Cites Work

• The Erdös discrepancy problem
• The logarithmically averaged Chowla and Elliott conjectures for two-point correlations
• Title not available (Why is that?)
• Complete sequences of polynomial values
• Long arithmetic progressions in sumsets: Thresholds and bounds
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Exact limit theorems for restricted integer partitions

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)