A Simple Proof and Some Difficult Examples for Hindman's Theorem

Details A Simple Proof and Some Difficult Examples for Hindman's Theorem A Simple Proof and Some Difficult Examples for Hindman's Theorem

2009-06-21

arxiv.org/abs/0906.3885v3

Mathematics

Combinatorics

Scientific paper

We give a short, explicit proof of Hindman's Theorem that in every finite
coloring of the integers, there is an infinite set all of whose finite sums
have the same color. We give several exampls of colorings of the integers which
do not have computable witnesses to Hindman's Theorem.

Affiliated with

Also associated with

No associations

Rating

A Simple Proof and Some Difficult Examples for Hindman's 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 Simple Proof and Some Difficult Examples for Hindman's Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Simple Proof and Some Difficult Examples for Hindman's Theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-506041