Infinitely often dense bases for the integers with a prescribed representation function

DOI10.1515/INTEG.2010.024zbMATH Open1221.11025arXivmath/0702279OpenAlexW2079752946MaRDI QIDQ3580714FDOQ3580714

Authors: Jae Woo Lee 

Publication date: 13 August 2010

Published in: Integers (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0702279

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• DENSE SETS OF INTEGERS WITH A PRESCRIBED REPRESENTATION FUNCTION
• Lower bounds for a conjecture of Erdős and Turán
• scientific article; zbMATH DE number 2066399
• Unique representation bases for the integers
• Every function is the representation function of an additive basis for the integers

zbMATH Keywords

additive basisrepresentation function

Mathematics Subject Classification ID

Density, gaps, topology (11B05) Additive bases, including sumsets (11B13) Representation functions (11B34)

Cited In (5)

• Unique representation bi-basis for the integers
• A problem on unique representation bases
• A UNIQUE REPRESENTATION BI-BASIS FOR THE INTEGERS. II
• Dense sets of integers with prescribed representation functions
• DENSE SETS OF INTEGERS WITH A PRESCRIBED REPRESENTATION FUNCTION

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)