English

Ruzsa's problem on Bi-Sidon sets

Combinatorics 2024-09-16 v2

Abstract

A subset SS of real numbers is called bi-Sidon if it is a Sidon set with respect to both addition and multiplication, i.e., if all pairwise sums and all pairwise products of elements of SS are distinct. Imre Ruzsa asked the following question: What is the maximum number f(N)f(N) such that every set SS of NN real numbers contains a bi-Sidon subset of size at least f(N)f(N)? He proved that f(N)cN13f(N)\geq cN^{\frac13}, for a constant c>0c>0. In this note, we improve this bound to N13+778+o(1)N^{\frac13+\frac7{78}+o(1)}.

Keywords

Cite

@article{arxiv.2409.03128,
  title  = {Ruzsa's problem on Bi-Sidon sets},
  author = {János Pach and Dmitrii Zakharov},
  journal= {arXiv preprint arXiv:2409.03128},
  year   = {2024}
}

Comments

9 pages, updated literature and exposition

R2 v1 2026-06-28T18:34:42.194Z