Answers are grounded in this paper and cite their sources.
For a nonempty set A of integers and an integer n, let rA(n) be the number of representations of n in the form $n=a+a'$ , where a a' and a, a'∈ A , and dA(n) be the number of representations of n in the form $n=a-a'$ , where a, a'∈ A . The binary support of a positive integer n is defined as the subset S(n) of nonnegative integers consisting of the exponents in the binary expansion of n, i.e., n=∑i∈ S(n) 2ⁱ , $S(-n)=-S(n)$ and S(0)=∅ . For real number x, let $A(-x,x)$ be the number of elements a∈ A with -x a x . The famous Erdős-Turán Conjecture states that if A is a set of positive integers such that rA(n) 1 for all sufficiently large n, then n→∞rA(n)=∞ . In 2004, Nešetřil and Serra initially introduced the notation of “bounded” property and confirmed the Erdős-Turán conjecture for a class of bounded bases. They also proved that, there exists a set A of integers satisfying rA(n)=1 for all integers n and |S(x) S(y)| 4|S(x+y)| for x,y∈ A . On the other hand, Nathanson proved that there exists a set A of integers such that rA(n)=1 for all integers n and 2log x/log 5+c₁ A(-x,x) 2log x/log 3+c₂ for all x 1 , where c₁,c₂ are absolute constants. In this paper, following these results, we prove that, there exists a set A of integers such that: rA(n)=1 for all integers n and dA(n)=1 for all positive integers n, |S(x) S(y)| 4|S(x+y)| for x,y∈ A and A(-x,x) > (4/log 5)loglog x+c for all x 1 , where c is an absolute constant. Furthermore, we also construct a family of arbitrarily spare such sets A.
No takes yet. Share an insight, caveat, or question.
A 2023 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: