A generalized Sidon set in the ordered-representation convention is a set of integers
for which
for every integer , where
is a fixed positive integer
(Matolcsi and Vinuesa 2010). The case
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
with
, then
where
is the constant in the autoconvolution
supremum problem (Matolcsi and Vinuesa 2010, Ivanisvili and Xie 2026). For nonempty
, this follows by putting height 1 on the cells indexed
by
in a partition of
into
equal intervals. The resulting step
function
has integral
and essential supremum
. Comparing these quantities
with the definition of
gives the bound. Thus an improved
lower bound for
improves the upper bound for
the size of generalized Sidon sets.