scientific article; zbMATH DE number 2202725

From MaRDI portal
Publication:5314795





A set of positive integers \(A\) is called a \(B_2^{\pm}[g]\) set if, for every pair of positive integers \(s,~d\), each one of the equations \(s=a+a'\) with \(a\leq a'\) in \(A\) and \(d=a'-a\) with \(a<a'\) in \(A\) has at most \(g\) solutions. Let \(F_{2,g}^{\pm}(N)\) be the maximum cardinality of a \(B_2^{\pm}[g]\) set contained in \(\{1,2,\ldots,N\}\). In this paper, the authors generalize the well-known fact that \(F_{2,1}^{\pm}(N)/{\sqrt{N}}\sim 1\) as \(N\) tends to infinity by showing that \(F_{2,g}^{\pm}(N)/{\sqrt{N}}\sim {\sqrt{g}}\) as \(N\) tends to infinity. The proof proceeds by giving lower and upper bounds on \(F_{2,g}^{\pm}(N)\). For the upper bound, the authors use the Cauchy-Schwartz inequality and prove (somewhat more than) that \(F_{2,g}^{\pm}(N)\leq (gN)^{1/2}+(gN)^{1/4}+1\), while for the lower bound they use a construction of modular Sidon sets due to Bose and primes in arithmetic progressions to infer that \(F_{2,g}^{\pm}(N)\geq {\sqrt{gN}}\). The paper concludes with an account of upper and lower bounds on \(F_{2,g}^{+}(N)\), which is defined in the similar way as \(F_{2,g}^{\pm}(N)\) but only the sum equations \(s=a+a'\) with \(a\leq a'\) in \(A\) are required to have at most \(g\) solutions for all positive integers \(s\), and one open problem.











This page was built for publication:

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