Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
natural numbers
|
| gptkbp:category |
infinite combinatorics
|
| gptkbp:field |
gptkb:Ramsey_theory
gptkb:mathematics combinatorics |
| gptkbp:generalizes |
finite sums theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hindman's theorem
|
| gptkbp:namedAfter |
Neil Hindman
|
| gptkbp:provenBy |
ultrafilter
|
| gptkbp:publishedIn |
gptkb:Transactions_of_the_American_Mathematical_Society
|
| gptkbp:relatedTo |
gptkb:Ramsey's_theorem
partition regularity |
| gptkbp:sentence |
For any finite coloring of the natural numbers, there exists an infinite set such that all finite sums of distinct elements from this set have the same color.
|
| gptkbp:yearProved |
1974
|
| gptkbp:bfsParent |
gptkb:Gowers'_Ramsey_theorem
|
| gptkbp:bfsLayer |
7
|