Answers are grounded in this paper and cite their sources.
Demonstrates the best upper bound for density of integer sequences with specific representation functions, suggesting new insights into base construction.
Nathanson constructed asymptotic bases for the integers with prescribed representation functions, 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 when we prescribe an arbitrary representation function.
No takes yet. Share an insight, caveat, or question.
Jae Wook Lee (2010) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: