TOPICS
Search

Generalized Sidon Set


A generalized Sidon set in the ordered-representation convention is a set A of integers for which

 r_A(m)=|{(a,b) in A×A:a+b=m}|<=g

for every integer m, where g is a fixed positive integer (Matolcsi and Vinuesa 2010). The case g=2 is an ordinary Sidon set. Some authors instead bound unordered representations. A pair of distinct summands contributes two ordered representations, while a repeated summand contributes only one, so these parameter conventions must be distinguished.

If A subset= {1,...,N} with N>=1, then

 |A|<=sqrt((2gN)/S),

where S is the constant in the autoconvolution supremum problem (Matolcsi and Vinuesa 2010, Ivanisvili and Xie 2026). For nonempty A, this follows by putting height 1 on the cells indexed by A in a partition of [-1/4,1/4] into N equal intervals. The resulting step function f(x) has integral |A|/(2N) and essential supremum ||f*f||_infty<=g/(2N). Comparing these quantities with the definition of S gives the bound. Thus an improved lower bound for S improves the upper bound for the size of generalized Sidon sets.


See also

Autoconvolution Supremum Problem, Sidon Set, Sumset

Explore with Wolfram|Alpha

References

Ivanisvili, P. and Xie, X. "Grokability in Five Inequalities." 6 May 2026. https://arxiv.org/abs/2605.05193v1.Matolcsi, M. and Vinuesa, C. "Improved Bounds on the Supremum of Autoconvolutions." J. Math. Anal. Appl. 372, 439-447.e2, 2010. https://doi.org/10.1016/j.jmaa.2010.07.030.

Cite this as:

Weisstein, Eric W. "Generalized Sidon Set." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GeneralizedSidonSet.html

Subject classifications