Some remarks on \(B_ h[g]\) sequences (Q1115910)

An increasing sequence of natural numbers \(A=(a_ i)\) is called \(B_ h[g]\) if every \(n\in {\mathbb{N}}\) can be written in at most g (g\(\geq 1)\) ways as a sum of h (h\(\geq 2)\) elements of A. Denote by \(F_ h(n,g)\) the cardinality of the largest \(B_ h[g]\) sequence in \(\{\) 1,...,n\(\}\). The main theorem which is proved via estimates of norms of trigonometric sums is the following estimate: \[ F_ h[n,g]\leq \frac{4g^{1/2}(h!)^{1/h}}{(3n)^{1/h}}\inf_{m\in {\mathbb{N}}}(\frac{(2mn^ 2+1/m)^{1/2h}}{2-1/m})^ 2. \] Two other upper bounds, apparently weaker than the above, are also obtained, one is via the ``local theory'' of Banach spaces and the other, mainly combinatorial in nature, uses an elementary gap result for the sequence of prime numbers.