# Popular differences and generalized Sidon sets

## TL;DR

This paper investigates the minimal maximum difference representation in subsets of integers, providing asymptotic formulas and connecting the problem to generalized Sidon sets, advancing understanding of additive combinatorics.

## Contribution

It offers explicit asymptotic expressions for the minimal maximum difference representation and links this problem to generalized Sidon sets, extending prior combinatorial results.

## Key findings

- Derived asymptotic formulas with explicit constants for the problem
- Connected the problem to the theory of generalized Sidon sets
- Provided bounds and explicit asymptotics for a large range of D

## Abstract

For a subset $A \subseteq [N]$, we define the representation function $ r_{A-A}(d) := \#\{(a,a') \in A \times A : d = a - a'\}$ and define $M_D(A) := \max_{1 \leq d < D} r_{A-A}(d)$ for $D>1$. We study the smallest possible value of $M_D(A)$ as $A$ ranges over all possible subsets of $[N]$ with a given size. We give explicit asymptotic expressions with constant coefficients determined for a large range of $D$. We shall also see how this problem connects to a well-known problem about generalized Sidon sets.