Abstract
The seminal results of Schur (Schur’s Lemma) and Hilbert (Hilbert Cube Lemma) eventually led to the development of a whole research area at the interface between Ramsey theory and additive combinatorics. In this context, one studies which additive combinatorial configurations in \(\mathbb {N}\) are partition regular, i.e. they can be found within a color of each finite coloring of \(\mathbb {N}\). While van der Waerden’s theorem on arithmetic progressions (discussed in the previous chapter) is the most famous early result in this area, several other additive configurations were later shown to be partition regular. Among these there are sets of finite sums of a finite sequence, which is the content of Folkman’s theorem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
D. Bartošová, A. Kwiatkowska, Lelek fan from a projective Fraïssé limit. Fund. Math. 231(1), 57–79 (2015)
J.E. Baumgartner, A short proof of Hindman’s theorem. J. Comb. Theory. Ser. A 17, 384–386 (1974)
W.W. Comfort, S. Negropontis, The theory of ultrafilters. Die Grundlehren der mathematischen Wissenschaften, Band 211, x+482 pp. (Springer, New York, 1974)
T. Gowers, Lipschitz functions on classical spaces. Eur. J. Comb. 13(3), 141–151 (1992)
R.L. Graham, B.L. Rothschild, Ramsey’s theorem for $n$-parameter sets. Trans. Am. Math. Soc. 159, 257–292 (1971)
N. Hindman, The existence of certain ultra-filters on \(\mathbb {N}\) and a conjecture of Graham and Rothschild. Proc. Am. Math. Soc. 36, 341–346 (1972)
N. Hindman, Finite sums from sequences within cells of a partition of $N$. J. Comb. Theory Ser. A 17, 1–11 (1974)
M. Lupini, Gowers’ Ramsey Theorem for generalized tetris operations. J. Comb. Theory Ser. A 149, 101–114 (2017)
D. Ojeda-Aristizabal, Finite forms of Gowers’ theorem on the oscillation stability of C 0. Combinatorica 37, 143–155 (2015)
J. Solymosi, Elementary additive combinatorics, in Additive Combinatorics. CRM Proceedings & Lecture Notes, vol. 43 (American Mathematical Society, Providence, 2007)
K. Tyros, Primitive recursive bounds for the finite version of Gowers’ $c_0$ theorem. Mathematika 61(3), 501–522 (2015)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Nasso, M.D., Goldbring, I., Lupini, M. (2019). From Hindman to Gowers. In: Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory. Lecture Notes in Mathematics, vol 2239. Springer, Cham. https://doi.org/10.1007/978-3-030-17956-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-17956-4_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-17955-7
Online ISBN: 978-3-030-17956-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)