Skip to content

Erdős problem 43

If Sidon sets A,B⊆{1,…,N}A, B \subseteq \{1, \dots, N\} satisfy (A−A)∩(B−B)={0}(A-A) \cap (B-B) = \{0\}, must (∣A∣2)+(∣B∣2)≤(f(N)2)+O(1)\binom{|A|}{2} + \binom{|B|}{2} \le \binom{f(N)}{2} + O(1), where f(N)f(N) is the largest Sidon-set size in [N][N] - and can the bound be improved by a fixed proportion when ∣A∣=∣B∣|A| = |B|?

Erdős Problems records this as disproved.

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal2 retained
  4. Resolutiondisproved
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Where the source files it646 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.