Upper and Lower Bounds for Finite Bh[g] Sequences Original Research Article

We give a non-trivial upper bound for Fh(g,N), the size of a Bh[g] subset of {1,…,N}, when g>1. In particular, we prove F2(g,N)less-than-or-equals, slant1.864(gN)1/2+1, and image. On the other hand, we exhibit B2[g] subsets of {1,…,N} with image, elements.