k-fold Sidon sets

From MaRDI portal
(Redirected from Publication:463053)
\(k\)-fold Sidon sets




Abstract: Let kgeq1 be an integer. A set AsubsetmathbbZ is a k-fold Sidon set if A has only trivial solutions to each equation of the form c1x1+c2x2+c3x3+c4x4=0 where 0leq|ci|leqk, and c1+c2+c3+c4=0. We prove that for any integer kgeq1, a k-fold Sidon set Asubset[N] has at most (N/k)1/2+O((Nk)1/4) elements. Indeed we prove that given any k positive integers c1<cdots<ck, any set Asubset[N] that contains only trivial solutions to ci(x1x2)=cj(x3x4) for each 1leilejlek, has at most (N/k)1/2+O((ck2N/k)1/4) elements. On the other hand, for any kgeq2 we can exhibit k positive integers c1,dots,ck and a set Asubset[N] with |A|ge(frac1k+o(1))N1/2, such that A has only trivial solutions to ci(x1x2)=cj(x3x4) for each 1leilejlek.









This page was built for publication: \(k\)-fold Sidon sets

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