✦ LIBER ✦

Some new results on subset sums

✍ Scribed by Van H. Vu

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 97 KB
Volume: 124
Category: Article
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2006.08.012

No coin nor oath required. For personal study only.

✦ Synopsis

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 representations.

📜 SIMILAR VOLUMES

New analytical results in subset-sum pro

New analytical results in subset-sum problem

✍ Gregory A Freiman 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 751 KB

Freiman, G.A., New analytical results in subset-sum problem, Discrete Mathematics 114 (1993) 205-218. An analytical method is developed to prove that, for the integer set k[l, I]. with I>/, and jAl=m>c,1"\*(log/) ) "2 the set A\* of subset sums contains a long arithmetic progression of length larger

Some results on intersecting families of

Some results on intersecting families of subsets

✍ Chuanzhong Zhu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 520 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

On the equal-subset-sum problem

✍ Gerhard J. Woeginger; Zhongliang Yu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 339 KB

On variations of the subset sum problem

✍ J.L. Ramírez Alfonsín 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 371 KB

In the well-known Subset Sum Problem, we are given positive integers a,, , a, and t and are to determine if some subset of the ai sums to t. We investigate the boundary between easy and hard variations of this problem. In particular, we consider the cases where the sequence 'A,~ .L' a,, \_\_\_ ,an i

Some new results on superimposed codes

✍ Hyun Kwang Kim; Vladimir Lebedev; Dong Yeol Oh 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

## Abstract A (__w__,__r__) __cover‐free family__ is a family of subsets of a finite set such that no intersection of __w__ members of the family is covered by a union of __r__ others. A (__w__,__r__) __superimposed code__ is the incidence matrix of such a family. Such a family also arises in crypt