Two problems on subset sums

From MaRDI portal
(Redirected from Two problems on subset sums)





The contribution of this papers fits inside the area of additive combinatorics, and more precisely on the theory of sumsets.\N\NFor a set \(A\) of positive integers, let \(P(A)\) denote the set of all finite subset sums of \(A\). In this work, the authors explore a problem due to Chen and Wu. The studied (and solved) problem is the following: if \(B = \{b_1 < b_2 < \cdots \}\) is a sequence of integers with \(b_1 \geq 11\), \(3b_1 + 5 \leq b_2 \leq 4b_1\), \(3b_2 + 2 \leq b_3 \leq 3b_2 + b_1\), and \(3b_n - b_{n-2} \leq b_{n+1} \leq 3b_n\) for \(n \geq 3\), then there exists a set of positive integers \(A\) for which \(P(A) = \mathbb{N} \setminus B\).\N\NThe authors also partially answer a problem of Wu by determining the structure of \(B = \{b_1 < b_2 < \cdots \}\) with \(b_1 > 10\) and \(b_2 > 3b_1 + 4\), for which there exists a set of positive integers \(A\) such that \[P(A \cap [0, b_k]) = [0, 2b_k] \setminus \{b_i, 2b_k - b_i : 1 \leq i \leq k\},\] for \(k \geq 2\).











This page was built for publication: Two problems on subset sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612296)