NEW UPPER BOUNDS FOR FINITE Bh SEQUENCES

Abstract

Let Fh(N) be the maximum number of elements that can be selected from the set {1, . . . , N} such that all the sums a1 + · · · + ah, a1 ≤ · · · ≤ ah are different. We introduce new combinatorial and analytic ideas to prove new upper bounds for Fh(N). In particular we prove F3(N) ≤   4 1 + 16 (π+2)4 N   1/3 + o(N), F4(N) ≤   8 1 + 16 (π+2)4 N   1/4… (More)

Topics

Cite this paper

@inproceedings{Cilleruelo2008NEWUB, title={NEW UPPER BOUNDS FOR FINITE Bh SEQUENCES}, author={Javier Cilleruelo}, year={2008} }