Mathematics – Combinatorics
Scientific paper
2010-01-07
Mathematics
Combinatorics
Scientific paper
Hindman's Theorem states that in any finite coloring of the integers, there is an infinite set all of whose finite sums belong to the same color. This is much stronger than the corresponding finite form, stating that in any finite coloring of the integers there are arbitrarily long finite sets with the same property. We extend the finite form of Hindman's Theorem to a "transfinite" version for each countable ordinal, and show that Hindman's Theorem is equivalent to the appropriate transfinite approximation holding for every countable ordinal. We then give a proof of Hindman's Theorem by directly proving these transfinite approximations.
Beiglböck Mathias
Towsner Henry
No associations
LandOfFree
Transfinite Approximation of 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 Transfinite Approximation of Hindman's Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transfinite Approximation of Hindman's Theorem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-501635