We investigate a number of questions concerning representations of a set of numbers as sums of subsets of some other set. In particular, we obtain several results on the possible sizes of the second set when the first set consists of a geometric sequence of integers, partially answering a generalisa
On subset sums of r-sets
โ Scribed by E. Lipkin
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 727 KB
- Volume
- 114
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
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 (ai= or 1, ateA) equal to a power of two. In this paper estimates for f'(n,r) are obtained. We prove that lim,_I x,=0, where r,=iG o_,~ f(n, r)/n. This result verifies a conjecture of Erdos and Freiman (1990).
๐ SIMILAR VOLUMES
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