A lower bound of Ruzsa's number related to the Erdős-Turán conjecture

preprint2016arXivOpen access

Abstract

For a set A⊆NA\subseteq \mathbb{N} and n∈Nn\in \mathbb{N}, let RA(n)R_A(n) denote the number of ordered pairs (a,a′)∈A×A(a,a')\in A\times A such that a+a′=na+a'=n. The celebrated Erdős-Turán conjecture says that, if RA(n)≥1R_A(n)\ge 1 for all sufficiently large integers nn, then the representation function RA(n)R_A(n) cannot be bounded. For any positive integer mm, Ruzsa's number RmR_m is defined to be the least positive integer rr such that there exists a set A⊆ZmA\subseteq \mathbb{Z}_m with 1≤RA(n)≤r1\le R_A(n)\le r for all n∈Zmn\in \mathbb{Z}_m. In 2008, Chen proved that Rm≤288R_{m}\le 288 for all positive integers mm. In this paper, we prove that Rm≥6R_m\ge 6 for all integers m≥36m\ge 36. We also determine all values of RmR_m when m≤35m\le 35.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.