Hindman's theorem: Difference between revisions
From Polymath Wiki
Jump to navigationJump to search
New page: '''Hindman's theorem''': If <math>[2]^\omega := \bigcup_{n=0}^\infty [2]^n</math> is finitely colored, then one of the color classes contain an infinite-dimensional [[combinatorial subspac... |
(No difference)
|
Revision as of 15:25, 15 February 2009
Hindman's theorem: If [math]\displaystyle{ [2]^\omega := \bigcup_{n=0}^\infty [2]^n }[/math] is finitely colored, then one of the color classes contain an infinite-dimensional combinatorial subspace, i.e. another copy of [math]\displaystyle{ [2]^\omega }[/math].
The generalization of this theorem to higher k is the Carlson-Simpson theorem.
