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

Hindman定理的一个弱变种强于Hilbert定理

A weak variant of Hindman's Theorem stronger than Hilbert's Theorem

Lorenzo Carlucci

AI总结:

引入Hindman定理的自然变种Adjacent Hindman's Theorem,证明其可由Ramsey定理推导且严格强于Hilbert定理,下界由递增极化Ramsey定理的直接组合蕴含给出。

摘要:

Hirst研究了Hindman有限和定理的一个微小变种——称为Hilbert定理,并证明它在$\RCA_0$上等价于适用于所有颜色的无限鸽巢原理。这给出了Hindman定理的一个自然限制的首个例子,该限制被证明比Hindman定理本身弱得多。我们在此引入Hindman定理的另一个自然变种——我们将其命名为Adjacent Hindman's Theorem——并证明它可由针对对的Ramsey定理证明,且严格强于Hirst的Hilbert定理。下界是通过对的递增极化Ramsey定理(由Dzhafarov和Hirst引入)从Adjacent Hindman's Theorem到该定理的直接组合蕴含获得的。在Adjacent Hindman's Theorem中,仅要求相邻元素的有限和具有齐性。

英文摘要:

Hirst investigated a slight variant of Hindman's Finite Sums Theorem -- called Hilbert's Theorem -- and proved it equivalent over $\RCA_0$ to the Infinite Pigeonhole Principle for all colors. This gave the first example of a natural restriction of Hindman's Theorem provably much weaker than Hindman's Theorem itself. We here introduce another natural variant of Hindman's Theorem -- which we name the Adjacent Hindman's Theorem -- and prove it to be provable from Ramsey's Theorem for pairs and strictly stronger than Hirst's Hilbert's Theorem. The lower bound is obtained by a direct combinatorial implication from the Adjacent Hindman's Theorem to the Increasing Polarized Ramsey's Theorem for pairs introduced by Dzhafarov and Hirst. In the Adjacent Hindman's Theorem homogeneity is required only for finite sums of adjacent elements.

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

↑