𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Schur Properties of Random Subsets of Integers

✍ Scribed by Ronald Graham; Vojtech Rödl; Andrzej Ruciński


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
792 KB
Volume
61
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis


A classic result of I. Schur [9] asserts that for every r 2 and for n sufficiently large, if the set [n]=[1, 2, ..., n] is partitioned into r classes, then at least one of the classes contains a solution to the equation x+ y=z. Any such solution with x{y will be called a Schur triple. Let us say that A [n] has the Schur property if for every partition (or 2-coloring) of A=R \_ B (for red and blue), there must always be formed some monochromatic Schur triple, i.e., belonging entirely to either R or B. Our goal here is to show that n 1Â2 is a threshold for the Schur property in the following sense: for any |=|(n) Ä , almost all sets A [n] with |A||n 1Â2 do.


📜 SIMILAR VOLUMES


Intersection Properties of Subsets of In
✍ Tibor Szabó 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Let N k be the maximal integer such that there exist subsets A 1 , . . . , A N k ⊆ {1, 2, . . . , n} for which A i ∩ A j is an arithmetic progression of length at least k for every 1 ≤ i < j ≤ N k . Graham, Simonovits and Sós gave the exact value of N 0 . For k ≥ 2, Simonovits and Sós determined the

On Optimal Subset Representations of Int
✍ Mike Develin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 121 KB

In this paper, we investigate representations of sets of integers as subset sums of other sets of minimal size, achieving results on the nature of the representing set as well as providing several reformulations of the problem. We apply one of these reformulations to prove a conjecture and extend a

Disjoint subsets of integers having a co
✍ Kiyoshi Ando; Severino Gervacio; Mikio Kano 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 262 KB

We prove that for positive integers n, m and k, the set (1, 2, . , n} of integers contains k disjoint subsets having a constant sum m if and only if 2k -1 G m c n(n + 1)/(2k).