Infinitely Often Dense Bases of Integers with a Prescribed Representation Function
Abstract
Description
Nathanson constructed asymptotic bases for the integers with a prescribed representation function, then asked how dense they can be. We can easily obtain an upper bound using a simple argument. In this paper, we will see this is indeed the best bound we can get for asymptotic bases for the integers with an arbitrary representation function prescribed.
8 pages, with new abstract and new introduction
8 pages, with new abstract and new introduction