Papers
Topics
Authors
Recent
Search
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)}$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.