AbstractAn (h, J)-distinct sum set is a set of J integers such that all sums of h elements (repetitions allowed) are distinct. An (h, I, J)-set of disjoint distinct sum sets is a set of I disjoint (h, J)-distinct sum sets with positive elements. A number of constructions of such sets are given
AbstractA (finite or infinite) set A of positive integers is said to be a Sidon set if the sums a + ...
AbstractA (finite or infinite) set A of positive integers is said to be a Sidon set if the sums a + ...
AbstractImproved lower bounds on multiple distinct sums sets are given. Lower bounds for the more ge...
AbstractAn (h, J)-distinct sum set is a set of J integers such that all sums of h elements (repetiti...
A set S of positive integers has distinct subset sums if there are 2 jSj distinct elements of the ...
AbstractImproved lower bounds on multiple distinct sums sets are given. Lower bounds for the more ge...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
Abstract. In this paper we prove that there exist infInitelv many disjoint sets of posItIve integers...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
AbstractA modified Bose-Chowla construction of sets with distinct sums of k-element subsets is prese...
In this paper we prove that there exist infInitely many disjoint sets of posItIve integers which the...
The purpose of this article is to present a solution to an interesting problem suggested by Richard...
A set S of positive integers has distinct subset sums if the set x∈X x: X ⊂ S � has 2 |S | distinct ...
AbstractA (finite or infinite) set A of positive integers is said to be a Sidon set if the sums a + ...
AbstractA (finite or infinite) set A of positive integers is said to be a Sidon set if the sums a + ...
AbstractImproved lower bounds on multiple distinct sums sets are given. Lower bounds for the more ge...
AbstractAn (h, J)-distinct sum set is a set of J integers such that all sums of h elements (repetiti...
A set S of positive integers has distinct subset sums if there are 2 jSj distinct elements of the ...
AbstractImproved lower bounds on multiple distinct sums sets are given. Lower bounds for the more ge...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
Abstract. In this paper we prove that there exist infInitelv many disjoint sets of posItIve integers...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
AbstractA modified Bose-Chowla construction of sets with distinct sums of k-element subsets is prese...
In this paper we prove that there exist infInitely many disjoint sets of posItIve integers which the...
The purpose of this article is to present a solution to an interesting problem suggested by Richard...
A set S of positive integers has distinct subset sums if the set x∈X x: X ⊂ S � has 2 |S | distinct ...
AbstractA (finite or infinite) set A of positive integers is said to be a Sidon set if the sums a + ...
AbstractA (finite or infinite) set A of positive integers is said to be a Sidon set if the sums a + ...
AbstractImproved lower bounds on multiple distinct sums sets are given. Lower bounds for the more ge...
DOI
Add to ORKG