Infinitely Often Dense Bases of Integers with a Prescribed Representation Function

Simple item page
dc.creatorLee, Jaewoo
dc.date2007-02-10
dc.date2007-04-26
dc.date.accessioned2026-07-07T07:58:17Z
dc.date.available2026-07-07T07:58:17Z
dc.descriptionNathanson 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.
dc.description8 pages, with new abstract and new introduction
dc.identifierhttps://arxiv.org/abs/math/0702279
dc.identifierhttp://arxiv.org/abs/math/0702279
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/127953
dc.subjectNumber Theory
dc.subjectCombinatorics
dc.subject11B13, 11B34 (Primary); 11B05, 05A99 (Secondary)
dc.titleInfinitely Often Dense Bases of Integers with a Prescribed Representation Function
dc.typetext

Files

Collections

arXiv