2000 character limit reached
Ruzsa's problem on Bi-Sidon sets
Published 4 Sep 2024 in math.CO | (2409.03128v2)
Abstract: A subset $S$ 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 $S$ are distinct. Imre Ruzsa asked the following question: What is the maximum number $f(N)$ such that every set $S$ of $N$ real numbers contains a bi-Sidon subset of size at least $f(N)$? He proved that $f(N)\geq cN{\frac13}$, for a constant $c>0$. In this note, we improve this bound to $N{\frac13+\frac7{78}+o(1)}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.