A note on \(B_{2k}\) sequences (Q1907847)

For a set \(A\subset\mathbb{N}\) let \(A(x): =\sum_{a\in A,1 \leq a\leq x}1\). \(A\) is called a \(B_h\)-sequence if \(\tau_A(n)\leq 1\) for all \(n\in\mathbb{N}\), that is if all \(h\)-fold sums \(a_1+ \cdots+ a_h\) with \(a_i\in A\) and \(a_1\leq \cdots\leq a_h\) are different. In the paper under review the author proves that every \(B_{2k}\)-sequence satisfies \[ \liminf_{n\to\infty} {A(n) \over n^{1/2k}} (\log n)^{1/(4k-4)} <\infty. \]