1996 | OriginalPaper | Chapter
Minimal Bases and g-Adic Representations of Integers
Author : Xing-De Jia
Published in: Number Theory: New York Seminar 1991–1995
Publisher: Springer US
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Let A be a set of integers, h ≥ 2 an integer. Let hA denote the set of all sums of h elements of A. If hA contains all sufficiently large integers, then A is called an asymptotic basis of order h. An asymptotic basis A of order h is said to be minimal if it contains no proper subset which is again an asymptotic basis of order h. This concept of minimality of bases was first introduced by Stöhr [5]. Härtter [1] showed the existence of minimal asymptotic bases by a nonconstructive argument. Nathanson [3] constructed the first nontrivial example of minimal asymptotic bases of order h ≥ 2. Jia and Nathanson [2] recently discovered a simple construction of minimal asymptotic bases of order h ≥ 2 by using powers of 2. Furthermore, for any α: 1/h ≤; α < 1, they constructed a minimal asymptotic basis A of order h such that xα < A(x) < xα, where A(x) is the number of positive elements not exceeding x. In the present paper, we shall generalize these results to g-adic representations of integers.