Elsevier

Journal of Number Theory

Volume 218, January 2021, Pages 152-160
Journal of Number Theory

General Section
On a problem of Nathanson on minimal asymptotic bases

https://doi.org/10.1016/j.jnt.2020.07.014Get rights and content

Abstract

Let N denote the set of all nonnegative integers and A be a subset of N. Let h be an integer with h2. Let nN and rh(A,n)={(a1,,ah)Ah:a1++ah=n}. The set A is called an asymptotic basis of order h if rh(A,n)1 for all sufficiently large integer n. An asymptotic basis A of order h is minimal if no proper subset of A is an asymptotic basis of order h. In 1988, Nathanson posed a problem on minimal asymptotic bases of order h. Recently, Chen and Tang showed that the answer to the problem is negative for h4 by constructing a special partition of N. In this paper, we give a new construction of minimal asymptotic bases. This construction expands our understanding on the problem of Nathanson.

Introduction

Let N denote the set of all nonnegative integers and A be a subset of N. Let h be an integer with h2. Let nN andrh(A,n)={(a1,,ah)Ah:a1++ah=n},hA={mN:m=a1++ah,aiA,i=1,2,,h}. The set A is called an asymptotic basis of order h if rh(A,n)1 for all sufficiently large integer n. An asymptotic basis A of order h is minimal if no proper subset of A is an asymptotic basis of order h. This means that for any aA, the set Ea=hA\h(A\{a}) is infinite.

In 1955, Stöhr [15] first introduced the concept of minimal asymptotic bases. In 1956, Härtter [6] gave a nonconstructive proof that there exist uncountably many minimal asymptotic bases of order h. In 1974, Nathanson [13] presented an explicit construction of a minimal asymptotic basis of order 2 by using binary representations. For every h2, Jia and Nathanson [9] gave an construction of a minimal asymptotic basis of order h. For related results concerning minimal asymptotic bases, see [3], [4], [5], [7], [8], [10], [11], [12], [16], [17].

Let W be a nonempty subset of N. Denote by F(W) the set of all finite, nonempty subsets of W. Let A(W) be the set of all numbers of the form fF2f, where FF(W). Let Sh be the symmetric group of h elements. In 1988, Nathanson [14] proved the following result:

Theorem A

Let h2. For i=0,1,,h1, let Wi={nN|ni(modh)}. Let A=A(W0)A(W1)A(Wh1). Then A is a thin, strongly minimal asymptotic basis of order h.

Nathanson [14] also posed the following problem (see also Jia and Nathanson [9]):

Problem 1.1

Let N=W0W1Wh1 be a partition such that ωWi implies either ω1Wi or ω+1Wi. IsA=A(W0)A(W1)A(Wh1) a minimal asymptotic basis of order h?

In 1989, Jia and Nathanson [9] obtained the following result:

Theorem B

Let h2 and t=log(h+1)/log2. Partition N into h pairwise disjoint subsets W0,W1,,Wh1 such that each set Wi contains infinitely many intervals of t consecutive integers. Then A=A(W0)A(W1)A(Wh1) is a minimal asymptotic basis of order h.

In 2011, Chen and Chen [1] proved Theorem B under the assumption only required that each set Wi contains one interval of t consecutive integers.

Theorem C

Let h2 and t be the least integer with t>logh/log2. Let N=W0W1Wh1 be a partition such that each set Wi is infinite and contains t consecutive integers for i=0,1,,h1. Then A=A(W0)A(W1)A(Wh1) is a minimal asymptotic basis of order h.

Recently, Chen and Tang [2] showed that the answer to the Problem 1.1 is negative for h4 by constructing a special partition of N.

Theorem D

Let h and t be integers with 2tlogh/log2. Then there exists a partition N=W0W1Wh1 such that each set Wi is a union of infinitely many intervals of at least t consecutive integers and A=A(W0)A(W1)A(Wh1) is not a minimal asymptotic basis of order h.

In this paper, we give a new construction of minimal asymptotic bases. This construction expands our understanding on the problem of Nathanson.

Theorem 1.1

Let h and t be positive integers with h2. Then there exists a partition N=W0W1Wh1 such that each set Wi is a union of infinitely many intervals of t consecutive integers andA=A(W0)A(W1)A(Wh1) is a minimal asymptotic basis of order h.

Section snippets

Proofs

To prove Theorem 1.1, we need the following Lemma.

Lemma 2.1

([14, Lemma 1])

(a) If W1 and W2 are disjoint subsets of N, then A(W1)A(W2)=.

(b) If WN and W(x)=θx+O(1) for some θ(0,1], then there exist positive constants c1 and c2 such thatc1xθ<A(W)(x)<c2xθ for all x sufficiently large.

(c) Let N=W0W1Wh1, where Wi for i=0,,h1. ThenA=A(W0)A(W1)A(Wh1) is an asymptotic basis of order h.

Proof of Theorem 1.1

For any integers a and b with ab, let [a,b] denote the set of all integers x with axb. Let H=[0,h1]. For

CRediT authorship contribution statement

Sun Cui-Fang: Term, Conceptualization, Software, Validation, Formal analysis, Investigation, Resources, Data curation, Writing - original draft, Writing - review & editing, Visualization, Supervision.

Acknowledgment

We are grateful to the anonymous referee for carefully reading our manuscript and also for his/her valuable comments.

References (17)

There are more references available in the full text version of this article.

This work was supported by the National Natural Science Foundation of China (Grant No. 11971033) and the Natural Science Foundation of Anhui Higher Education Institutions of China (No. KJ2018A0304, KJ2019A0488).

View full text