arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.02473math.CO
收藏

Folkman定理的一个改进的下界

An improved lower bound for Folkman's theorem

József Balogh, Sean Eberhard, Bhargav Narayanan, Andrew Treglown, Adam Zsolt Wagner

摘要:

Folkman定理断言,对于每个$k \in \mathbb{N}$,存在一个自然数$n = F(k)$,使得只要$[n]$的元素是双色的,就存在一个大小为$k$的集合$A \subset [n]$,其性质是所有形式为$\sum_{x \in B} x$的和,其中$B$是$A$的非空子集,都包含在$[n]$中,并且具有相同的颜色。在1989年,Erdens和Spencer证明了$F(k) \ge 2^{ck^2/ \log k}$,其中$c >0$是一个绝对常数;在这里,我们通过证明对所有$k\in \mathbb{N}$都有$F(k) \ge 2^{2^{k-1}/k}$来显著改进这个界限。

英文摘要:

Folkman's Theorem asserts that for each $k \in \mathbb{N}$, there exists a natural number $n = F(k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $A \subset [n]$ of size $k$ with the property that all the sums of the form $\sum_{x \in B} x$, where $B$ is a nonempty subset of $A$, are contained in $[n]$ and have the same colour. In 1989, Erdős and Spencer showed that $F(k) \ge 2^{ck^2/ \log k}$, where $c >0$ is an absolute constant; here, we improve this bound significantly by showing that $F(k) \ge 2^{2^{k-1}/k}$ for all $k\in \mathbb{N}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑