2015/04/28 by Sándor Z. Kiss, Kiss, Sándor Z., Csaba Sándor +1
Computer Science · Mathematics · #Analytic Number Theory Research #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #Number Theory (math.NT) #math.NT
paper · pdf · doi:10.48550/arxiv.1504.07411
openalex publication_date 2015/04/28 · arxiv created 2015/07/16 · arxiv updated 2015/07/17 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28
Let A and B be sets of nonnegative integers. For a positive integer n let RA(n) denote the number of representations of n as the sum of two terms from A. Let sA(x) = maxn ≤ xRA(n) and dA,B(x) = max_\hboxt: at ≤ x or bt ≤ x|at - bt|. In this paper we study the connection between sA(x), sB(x) and dA,B(x). We improve a result of Haddad and Helou about the Erdős - Turán conjecture.