✦ LIBER ✦

Subset sums

✍ Scribed by N. Alon

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 522 KB
Volume: 27
Category: Article
ISSN: 0022-314X
DOI: 10.1016/0022-314x(87)90061-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Arithmetic progressions in subset sums

✍ P. Erdo&#x030B;s; A. Sárközy 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 693 KB

~roughout this paper we use the following notatians: The cardinality of the finite set Y is denoted by ISI -.s& B8, . I s den&e finite or infinite sets of positive integers. If & is a finite or infinite set of positive integers, then S(d) denotes the set of the distinct positive integers n that can

Subset sums in binary spaces

✍ Gilles Ze´mor 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 599 KB

Sum-Avoiding Subsets

✍ Imre Z. Ruzsa 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 163 KB

On subset sums of r-sets

✍ E. Lipkin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 727 KB

Lipkin, E., On subset sums of r-sets, Discrete Mathematics 114 (1993) 3677377. A finite set of distinct integers is called an r-set if it contains at least r elements not divisible by 4 for each 4 > 2. Let f(n, r) denote the maximum cardinality of an r-set A c (1,2, , n} having no subset sum Caiai

Some new results on subset sums

✍ Van H. Vu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Let n be a large integer and A be a subset of [n] = {1, . . . , n}. The set S A is the collection of the subset sums of A. In this note, we discuss new results (and proofs) on few well-known problems concerning S A . In particular, we improve an estimate of Alon and Erdős concerning monochromatic re

Minimum Range Balanced Cuts via Dynamic

Minimum Range Balanced Cuts via Dynamic Subset Sums

✍ David Eppstein 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 161 KB