A combinatorial proof of the Dense Hindman’s Theorem |
| |
Authors: | Henry Towsner |
| |
Institution: | aDepartment of Mathematics, UCLA, 90095, United States |
| |
Abstract: | The Dense Hindman’s Theorem states that, in any finite coloring of the natural numbers, one may find a single color and a “dense” set B1, for each b1∈B1 a “dense” set (depending on b1), for each a “dense” set (depending on b1,b2), and so on, such that for any such sequence of bi, all finite sums belong to the chosen color. (Here density is often taken to be “piecewise syndetic”, but the proof is unchanged for any notion of density satisfying certain properties.) This theorem is an example of a combinatorial statement for which the only known proof requires the use of ultrafilters or a similar infinitary formalism. Here we give a direct combinatorial proof of the theorem. |
| |
Keywords: | Hindman&rsquo s Theorem |
本文献已被 ScienceDirect 等数据库收录! |
|