2007/02/10 by Jaewoo Lee, Lee Jaewoo, Lee, Jaewoo
Computer Science · Engineering · Mathematics · #05A99 (Secondary) #11B05 #11B13 #11B34 (Primary) #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Number Theory (math.NT) #Polynomial and algebraic computation #graph theory and CDMA systems #math.CO #math.NT #msc:05A99 #msc:11B05 #msc:11B13 #msc:11B34
paper · pdf · doi:10.48550/arxiv.math/0702279
8 pages, with new abstract and new introduction
openalex publication_date 2007/02/10 · arxiv created 2007/04/26 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.