Infinitely often dense bases for the integers with a prescribed representation function
From MaRDI portal
Abstract: 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.
Recommendations
- DENSE SETS OF INTEGERS WITH A PRESCRIBED REPRESENTATION FUNCTION
- Lower bounds for a conjecture of Erdős and Turán
- The inverse problem for representation functions of additive bases
- Unique representation bases for the integers
- Every function is the representation function of an additive basis for the integers
Cited in
(6)- Dense sets of integers with prescribed representation functions
- DENSE SETS OF INTEGERS WITH A PRESCRIBED REPRESENTATION FUNCTION
- A UNIQUE REPRESENTATION BI-BASIS FOR THE INTEGERS. II
- Unique representation bi-basis for the integers
- Solutions to some problems on unique representation bases
- A problem on unique representation bases
This page was built for publication: Infinitely often dense bases for the integers with a prescribed representation function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580714)