A new upper bound for finite additive bases

Simple item page
dc.creatorGunturk, Sinan
dc.creatorNathanson, Melvyn B.
dc.date2005-03-13
dc.date.accessioned2026-07-07T05:17:54Z
dc.date.available2026-07-07T05:17:54Z
dc.descriptionLet n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this paper it is proved that limsup_{k\to\infty} n(2,k)/k^2 \leq 0.4789.
dc.description19 pages; LaTex
dc.identifierhttps://arxiv.org/abs/math/0503241
dc.identifierhttp://arxiv.org/abs/math/0503241
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74473
dc.subjectNumber Theory
dc.subjectCombinatorics
dc.subject11B13
dc.titleA new upper bound for finite additive bases
dc.typetext

Files

Collections

arXiv