Let **N** be the set {1, 2, 3, ...} of positive integers, and suppose that **N** is partitioned into *k* different subsets *N*_{1}, *N*_{2}, ... *N*_{k}, where *k* is any positive integer. Then Folkman's theorem states that, for every positive integer *m*, there exists a set *S*_{m} and an index *i*_{m} such that *S*_{m} has *m* elements and such that every sum of a nonempty subset of *S*_{m} belongs to *N*_{im}.^{}

Schur's theorem in Ramsey theory states that, for any finite partition of the positive integers, there exist three numbers *x*, *y*, and *x* + *y* that all belong to the same partition set. That is, it is the special case *m* = 2 of Folkman's theorem.

Rado's theorem in Ramsey theory concerns a similar problem statement in which the integers are partitioned into finitely many subsets; the theorem characterizes the integer matrices **A** with the property that the system of linear equations **A** *x* = 0 can be guaranteed to have a solution in which every coordinate of the solution vector *x* belongs to the same subset of the partition. A system of equations is said to be *regular* whenever it satisfies the conditions of Rado's theorem; Folkman's theorem is equivalent to the regularity of the system of equations

where *T* ranges over each nonempty subset of the set {1, 2, ..., *m*}.^{}

It is possible to replace addition by multiplication in Folkman's theorem: if the natural numbers are finitely partitioned, there exist arbitrarily large sets *S* such that all products of nonempty subsets of *S* belong to a single partition set. Indeed, if one restricts *S* to consist only of powers of two, then this result follows immediately from the additive version of Folkman's theorem. However, it is open whether there exist arbitrarily large sets such that all sums and all products of nonempty subsets belong to a single partition set. It is not even known whether there must necessarily exist a set of the form {*x*, *y*, *x* + *y*, *xy*} for which all four elements belong to the same partition set.^{}

This page was last edited on 21 February 2018, at 10:29.

Reference: https://en.wikipedia.org/wiki/Folkman%27s_theorem under CC BY-SA license.

Reference: https://en.wikipedia.org/wiki/Folkman%27s_theorem under CC BY-SA license.

- Theorem
- Arithmetic Combinatorics
- Ramsey Theory
- Natural Numbers
- Partitioned
- JonĀ Folkman
- Graham
- Rothschild
- Spencer
- Schur's Theorem
- Rado's Theorem
- System Of Linear Equations
- Powers Of Two

- Folkman%27s Theorem
- Transduction (genetics)
- Museum Of Medieval Stockholm
- Carn Gafallt
- Abe Clan
- Transcytosis
- Colchester (electoral District)
- Transcription (linguistics)
- Gephyromantis Boulengeri
- Robots.txt
- Carminic Acid
- Wordpresswp-admin
- Transcription (genetics)
- NASL Final 1974
- File:Saskatchewan Highway 918 (jct).svg
- NOFX
- Transatlantic Slave Trade
- Carmine Persico
- Battle Of %C3%9Cr%C3%BCmqi (1933)
- Tefal
- TransMilenio
- Eloi
- Carmine Pecorelli
- Trans-Saharan Trade
- Mechanic%27s Lien
- Trance
- Carmine Infantino
- Manhattan Eye, Ear And Throat Hospital
- Track (disk Drive)
- Tram