Upper bounds for the order of an additive basis obtained by removing a finite subset of a given basis

From MaRDI portal
Publication:1024406

DOI10.1016/J.JNT.2008.02.006zbMATH Open1195.11019arXiv0902.3093OpenAlexW2963950328MaRDI QIDQ1024406FDOQ1024406


Authors: Bakir Farhi Edit this on Wikidata


Publication date: 17 June 2009

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: Let A be an additive basis of order h and X be a finite nonempty subset of A such that the set AsetminusX is still a basis. In this article, we give several upper bounds for the order of AsetminusX in function of the order h of A and some parameters related to X and A. If the parameter in question is the cardinality of X, Nathanson and Nash already obtained some of such upper bounds, which can be seen as polynomials in h with degree (|X|+1). Here, by taking instead of the cardinality of X the parameter defined by d:=fracdiam(X)gcdxy|x,yinX, we show that the order of AsetminusX is bounded above by (frach(h+3)2+dfrach(h1)(h+4)6). As a consequence, we deduce that if X is an arithmetic progression of length geq3, then the upper bounds of Nathanson and Nash are considerably improved. Further, by considering more complex parameters related to both X and A, we get upper bounds which are polynomials in h with degree only 2.


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




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Upper bounds for the order of an additive basis obtained by removing a finite subset of a given basis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024406)