Classification of greedy subset-sum-distinct-sequences. (Q1408883)

A subset-sum-distinct- sequence \(M\) is a (finite or infinite) sequence of integers such that for all subsets \(A,B\subseteq M\) \((A\neq B)\) for the subset-sums is \(\sum_{a_i\in A}a_i\neq \sum_{b_j\in B} b_j\). Here subset-sum-distinct-sequences are considered having the property that for any given integers \(a\) and \(q\) no subset-sum is congruent to \(a\text{\,mod\,}q\). A classification is provided of these sequences, in order to determine which of these have maximal reciprocal sums. A greedy sequence is one which tries to maximize its reciprocal sum by making each successive term in the sequence as small as possible. In classifying the greedy sequences the author resolves two of the three conjectures made by \textit{J. Bae} [Discrete Math. 189, No. 1--3, 1--20 (1998; Zbl 0951.11010)].