Ruzsa's problem on Bi-Sidon sets

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)≥ cN13, for a constant c>0. In this note, we improve this bound to N13+778+o(1).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…