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
β¦ LIBER β¦
On sums of subsets of a set of integers
β Scribed by N. Alon; G. Freiman
- Publisher
- Springer-Verlag
- Year
- 1988
- Tongue
- English
- Weight
- 452 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On subset sums of r-sets
β
E. Lipkin
π
Article
π
1993
π
Elsevier Science
π
English
β 727 KB
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).
On large families of subsets of the set
β
CΓ©cile Dartyge; Elie Mosaki; AndrΓ‘s SΓ‘rkΓΆzy
π
Article
π
2008
π
Springer US
π
English
β 473 KB
On sums of powers of integers
β
Roger Cook
π
Article
π
1979
π
Elsevier Science
π
English
β 447 KB
On sums of sequences of integers. II
β
A. Balog; A. SΓ‘rkΓΆzy
π
Article
π
1984
π
Akadmiai Kiad
π
English
β 382 KB