Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

The one-exception Sidon problem

../

established_bounds: The published leading bounds and the reflected construction behind the lower bound; the target remains unresolved.

source_notes/: Paper summaries and source comparisons used in the research on Problem 864.


Let M(N)M(N) be the largest size of A⊆{1,…,N}A\subseteq\{1,\ldots,N\} for which at most one integer has two or more unordered representations a+ba+b, including diagonal pairs. The target is

M(N)≤(23+o(1))N.M(N)\le\left(\frac2{\sqrt3}+o(1)\right)\sqrt N.

The published bounds are

(23+o(1))N≤M(N)≤(2+o(1))N.\left(\frac2{\sqrt3}+o(1)\right)\sqrt N \le M(N) \le(2+o(1))\sqrt N.

The established bounds page gives the reflected construction behind the lower bound. The leading constant is undetermined.