Bergelson, Vitaly; Hindman, Neil; Leader, Imre Additive and multiplicative Ramsey theory in the reals and the rationals. (English) Zbl 0917.05080 J. Comb. Theory, Ser. A 85, No. 1, 41-68 (1999). The paper discusses Ramsey theoretic results for finite partitions of the real interval \((0,1)\). Using two different approaches, one based on Stone-Čech compactifications and the other based on elementary methods, the authors show that for every finite partition of the real interval \((0,1)\) into measurable subsets or into Baire sets, respectively, at least one member of the partition contains a sequence with all of its finite sums and products. Moreover, partitions of the rationals and of the dyadic rationals are discussed, for which separate additive and multiplicative statements are derived. A counterexample is given showing that even weak versions of the combined additive and multiplicative results that were proven for the real interval \((0,1)\) do not hold for the dyadic rationals. The related question for the rationals remains open, but a negative answer is conjectured also for this case. Reviewer: Kathrin Klamroth (Kaiserslautern) Cited in 7 Documents MSC: 05D10 Ramsey theory Keywords:additive Ramsey theory; multiplicative Ramsey theory PDF BibTeX XML Cite \textit{V. Bergelson} et al., J. Comb. Theory, Ser. A 85, No. 1, 41--68 (1999; Zbl 0917.05080) Full Text: DOI Link References: [1] Bergelson, V.; Hindman, N., A combinatorially large cell of a partition of \(N\), J. Combin. Theory Ser. A, 48, 39-52 (1988) · Zbl 0642.05003 [2] Bergelson, V.; Hindman, N., Nonmetrizable topological dynamics and Ramsey Theory, Trans. Amer. Math. Soc., 320, 293-320 (1990) · Zbl 0725.22001 [3] Bergelson, V.; Hindman, N., Additive and multplicative Ramsey Theorems in \(N\)-Some elementary results, Combin. Probab. and Comput., 2, 221-241 (1993) · Zbl 0794.05127 [5] Berglund, J.; Junghenn, H.; Milnes, P., Analysis on Semigroups (1989), Wiley: Wiley New York [6] Deuber, W.; Hindman, N., Partitions and sums of \((mpc\), J. Combin. Theory Ser. A, 45, 300-302 (1987) · Zbl 0661.05008 [7] Graham, R.; Rothschild, B.; Spencer, J., Ramsey Theory (1990), Wiley: Wiley New York [8] Hindman, N., Finite sums from sequences within cells of a partition of \(N\), J. Combin. Theory Ser. A, 17, 1-11 (1974) · Zbl 0285.05012 [9] Hindman, N., Partitions and sums and products of integers, Trans. Amer. Math. Soc., 247, 227-245 (1979) · Zbl 0401.05012 [10] Hindman, N., Partitions and pairwise sums and products-two counterexamples, J. Combin. Theory Ser. A, 29, 113-120 (1980) · Zbl 0443.05010 [11] Hindman, N., Summable ultrafilters and finite sums, Contemp. Math., 65, 263-274 (1987) · Zbl 0634.03046 [12] Hindman, N., Ultrafilters and Ramsey theory-an update, (Steprāns, J.; Watson, S., Set Theory and its Applications. Set Theory and its Applications, Lecture Notes in Math., 1401 (1989)), 97-118 [13] Hindman, N.; Woan, W., Central sets in semigroups and partition regularity of systems of linear equations, Mathematika, 40, 169-186 (1993) · Zbl 0790.05092 [14] Oxtoby, J., Measure and Category (1971), Springer-Verlag: Springer-Verlag Berlin · Zbl 0217.09201 [15] Plewik, S.; Voigt, B., Partitions of reals: Measurable approach, J. Combin. Theory Ser. A, 58, 136-140 (1991) · Zbl 0739.05003 [16] Prömel, H.; Voigt, B., A partition theorem for [0,1], Proc. Amer. Math. Soc., 109, 281-285 (1990) · Zbl 0726.05011 [17] Rado, R., Note on combinatorial analysis, Proc. London Math. Soc., 48, 122-160 (1943) · Zbl 0028.33801 [18] Shelah, S., Can you take Solovay’s inaccessible away?, Israel J. Math., 48, 1-47 (1984) · Zbl 0596.03055 [19] Solovay, R. M., A model of set theory in which every set of reals is Lebesgue measurable, Ann. Math., 92, 1-56 (1970) · Zbl 0207.00905 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.