𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Additive and Multiplicative Ramsey Theory in the Reals and the Rationals

✍ Scribed by Vitaly Bergelson; Neil Hindman; Imre Leader


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
232 KB
Volume
85
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis


Let a finite partition F of the real interval (0, 1) be given. We show that if every member of F is measurable or if every member of F is a Baire set, then one member of F must contain a sequence with all of its finite sums and products (and, in the measurable case, all of its infinite sums as well). These results are obtained by using the algebraic structure of the Stone C 8 ech compactification of the real numbers with the discrete topology. They are also obtained by elementary methods.

In each case we in fact get significant strengthenings of the above stated results (with different strengthenings obtained by the algebraic and elementary methods). Some related (although weaker) results are established for arbitrary partitions of the rationals and the dyadic rationals, and a counterexample is given to show that even weak versions of the combined additive and multiplicative results do not hold in the dyadic rationals.


πŸ“œ SIMILAR VOLUMES


On the Additive and Multiplicative Model
✍ Dr. Ralph L. Kodell; D. W. Gaylor πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 672 KB

Two popular models of absence of synergism in epidemiologic cohort studies are analyzed and compared. It is shown that the statistical concept of the union of independent events that traditionally haa given rise to the "additive" model of relative risk can ale0 generate the "multiplicative" model of

Graph Ramsey Theory and the Polynomial H
✍ Marcus Schaefer πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 402 KB

In the Ramsey theory of graphs F Γ„ (G, H) means that for every way of coloring the edges of F red and blue F will contain either a red G or a blue H. Arrowing, the problem of deciding whether F Γ„ (G, H), lies in 6 p 2 =coNP NP and it was shown to be coNP-hard by Burr [Bur90]. We prove that Arrowing