The upper logarithmic density of monochromatic subset sums

The upper logarithmic density of monochromatic subset sums
复制标题

DOI:
10.1112/mtk.12167
复制
发表时间:
2021-05
期刊:
影响因子:
0.8
通讯作者:
D. Conlon;J. Fox;H. Pham
D. Conlon;J. Fox;H. Pham
中科院分区:
数学3区
文献类型:
--
作者:
D. Conlon;J. Fox;H. Pham

文献摘要

相似文献

我们证明了在正整数的任何两个着色中,存在一种颜色,对于这种颜色,可以表示为具有这种颜色的不同元素之和的正整数集合具有至少(2+3)/4$(2+\sqrt {3})/4$的上对数密度,并且这是最好的可能。这回答了一个40年前的关于埃尔德什的问题
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+3)/4$(2+\sqrt {3})/4$ and this is best possible. This answers a 40‐year‐old question of Erdős.