A Combinatorial Proof of the Dense Hindman Theorem

Details A Combinatorial Proof of the Dense Hindman Theorem A Combinatorial Proof of the Dense Hindman Theorem

2010-02-01

arxiv.org/abs/1002.0347v1

Mathematics

Combinatorics

Scientific paper

The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a "dense" set $B_3^{b_1,b_2}$ (depending on $b_1,b_2$), and so on, such that for any such sequence of $b_i$, 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.

Affiliated with

Also associated with

No associations

Rating

A Combinatorial Proof of the Dense Hindman Theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Combinatorial Proof of the Dense Hindman Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Combinatorial Proof of the Dense Hindman Theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706156