Upper and lower bounds on the size of B_k[g] sets

From MaRDI portal
Publication:5863480




Abstract: A subset A of the integers is a Bk[g] set if the number of multisets from A that sum to any fixed integer is at most g. Let Fk,g(n) denote the maximum size of a Bk[g] set in 1,dots,n. In this paper we improve the best-known upper bounds on Fk,g(n) for g>1 and k large. When g=1 we match the best upper bound of Green with an improved error term. Additionally, we give a lower bound on Fk,g(n) that matches a construction of Lindstr"om while removing one of the hypotheses.











This page was built for publication: Upper and lower bounds on the size of \(B_k[g]\) sets

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