Hostname: page-component-5db58dd55d-8lnk4 Total loading time: 0 Render date: 2026-05-25T20:26:16.369Z Has data issue: false hasContentIssue false
  • English
  • Français

Additive and Multiplicative Ramsey Theorems in ℕ – Some Elementary Results†

Published online by Cambridge University Press:  12 September 2008

Vitaly Bergelson  and
Neil Hindman
Vitaly Bergelson
Affiliation:
Department of Mathematics, Ohio State University, Columbus OH 43210, USA
Neil Hindman
Affiliation:
Department of Mathematics, Howard University, Washington DC 20059, USA
Get access Rights & Permissions [Opens in a new window]

Abstract

We show by elementary methods that given any finite partition of the set ℕ of positive integers, there is one cell that is both additively and multiplicatively rich. In particular, this cell must contain a sequence and all of its finite sums, and another sequence and all of its finite products, a fact that was previously known only by utilizing the algebraic structure of the Stone–Čech compactification βℕ of ℕ.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 2 , Issue 3 , September 1993 , pp. 221 - 241
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Baumgartner, J. (1974) A short proof of Hindman's Theorem. J. Comb. Theory (Series A) 17 384–386.CrossRefGoogle Scholar
[2]Bergelson, V. (1986) A density statement generalizing Schur's Theorem. J. Comb. Theory (Series A) 43 338–343.CrossRefGoogle Scholar
[3]Bergelson, V. and Hindman, N. (1988) A combinatorially large cell of a partition of ℕ. J. Comb. Theory (Series A) 48 39–52.CrossRefGoogle Scholar
[4]Bergelson, V. and Hindman, N. (1990) Nonmetrizable topological dynamics and Ramsey Theory. Trans. Amer. Math. Soc. 320 293–320.CrossRefGoogle Scholar
[5]Blass, A., Hirst, J. and Simpson, S. (1987) Logical analysis of some theorems of combinatorics and topological dynamics. In: Simpson, S. (ed.) Logic and Combinatorics Contemporary Math. 65 125–156.CrossRefGoogle Scholar
[6]Comfort, W. (1977) Ultrafilters: some old and some new results. Bull. Amer. Math. Soc. 83 417–455.CrossRefGoogle Scholar
[7]Deuber, W. (1973) Partitionen und lineare Gleichungssysteme. Math. Zeit 133 109–123.CrossRefGoogle Scholar
[8]Ellis, R. (1969) Lectures in topological dynamics, Benjamin, New York.Google Scholar
[9]Furstenberg, H. (1977) Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions. J. Anal. Math. 31 204–256.CrossRefGoogle Scholar
[10]Furstenberg, H. (1981) Recurrence in ergodic theory and combinatorial number theory, Princeton Univ. Press, Princeton.CrossRefGoogle Scholar
[11]Furstenberg, H. and Weiss, B. (1978) Topological Dynamics and combinatorial number theory. J. Anal. Math. 34 61–85.CrossRefGoogle Scholar
[12]Graham, R., Rothschild, B. and Spencer, J. (1990) Ramsey Theory, Wiley, New York.Google Scholar
[13]Hindman, N. (1974) Finite sums from sequences within cells of a partition of ℕ. J. Comb. Theory (Series A) 17 1–11.CrossRefGoogle Scholar
[14]Hindman, N. (1984) Partitions and pairwise sums and products. J. Comb. Theory (Series A) 37 46–60.CrossRefGoogle Scholar
[15]Hindman, N. (1979) Partitions and sums and products of integers. Trans. Amer. Math. Soc. 247 227–245.CrossRefGoogle Scholar
[16]Hindman, N. (1986) The ideal structure of the space of k-uniform ultrafilters on a discrete semigroup. Rocky Mountain J. Math. 16 689–701.CrossRefGoogle Scholar
[17]Hindman, N. (1979) Ultrafilters and combinatorial number theory. In: Nathanson, M. (ed.) Number Theory Carbondale. Lecture Notes in Math. 751 119–184.Google Scholar
[18]Hindman, N. and Woan, W. (to appear) Central sets in commutative semigroups and partition regularity of systems of linear equations. Mathematika.Google Scholar
[19]Rado, R. (1933) Studien zur Kombinatorik. Math. Zeit. 36 242–280.CrossRefGoogle Scholar
[20]van der Waerden, B. (1927) Beweis einer Baudetschen Vermutung. Nieuw Arch. Wisk. 15 212–216.Google Scholar