Abstract
Jia and Nathanson [2] give a simple and explicit construction of minimal asymptotic bases of orderh for everyh≥2. They constructed minimal asymptotic bases from partition of N by means of powers of 2. In this paper, we extend the results of that paper to asymptotic bases constructed from partitions of N by means ofg-adic representations forg≥2. Corollary 3 shows that given partition N=W0⌣W1⌣...⌣Wh−1 such that eachWi contains infinitely many pairs of consecutive integers we can construct a minimal asymptotic bases of orderh in infinitely many way.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
