Ruzsa's problem on Bi-Sidon sets
Combinatorics
2024-09-16 v2
Abstract
A subset 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 are distinct. Imre Ruzsa asked the following question: What is the maximum number such that every set of real numbers contains a bi-Sidon subset of size at least ? He proved that , for a constant . In this note, we improve this bound to .
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