The Erdős–Turán property for a class of bases (Q4829580)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2120284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Erdős–Turán property for a class of bases |
scientific article; zbMATH DE number 2120284 |
Statements
The Erdős–Turán property for a class of bases (English)
0 references
29 November 2004
0 references
additive bases
0 references
number of representations
0 references
0.8969411
0 references
0 references
0.8835515
0 references
0.8827746
0 references
0.88142055
0 references
0.88009894
0 references
0 references
0.87376887
0 references
0 references
For a set \(A\subseteq \mathbb{N}\) let \(r_A(n)\) denote the number of ordered pairs \((a,a')\in A\times A\) such that \(a+a'=n\). A set \(A\) is an (asymptotic additive) basis of order 2 if there is an \(n_0=n_0(A)\) such that \(r_A(n)\geq 1\) for each integer \(n\geq n_0\). It was conjectured by \textit{P. Erdős} and \textit{P. Turán} [J. Lond. Math. Soc. 16, 212--215 (1941; Zbl 0061.07301, JFM 67.0984.03)] that if \(A\) is a basis, then \[ \lim_{n\to\infty}\sup r_A(a)=\infty. \] The binary support of an \(n\in\mathbb{N}\) is the subset \(S(n)\subset \mathbb{N}\cup\{0\}\) of its binary expansion \[ n=\sum_{i\in S(n)} 2^i. \] A set \(A\subset \mathbb{N}\) is bounded if there is a function \(f\) such that for each \(n\in A+A\) there is a pair \(x, y \in A\) with \(n=x+y\) and \(|S(x)\cup S(y)|\leq f(|S(n)|).\) The authors prove the following result (Theorem 1): Let \(A\) be a bounded basis of order 2. Then \[ \lim_{n\to\infty}\sup r_A(n)=\infty. \] In fact they prove a more general form of this result. Further the analogous questions for bases of order \(h\geq 2\) and for additive bases for \(\mathbb{Z}\) are considered.
0 references