Essentialness in additive bases
From MaRDI portal
Publication:868906
DOI10.1016/J.JNT.2006.06.002zbMATH Open1114.11011arXiv0802.1205OpenAlexW2058629509MaRDI QIDQ868906FDOQ868906
Authors: Bruno Deschamps, Bakir Farhi
Publication date: 26 February 2007
Published in: Journal of Number Theory (Search for Journal in Brave)
Abstract: In this article we study the notion of essential subset of an additive basis, that is to say the minimal finite subsets of a basis such that doesn't remains a basis. The existence of an essential subset for a basis is equivalent for this basis to be included, for almost all elements, in an arithmetic non-trivial progression. We show that for every basis there exists an arithmetic progression with a biggest common difference containing . Having this common difference we are able to give an upper bound to the number of essential subsets of : this is the radical's length of (in particular there is always many finite essential subsets in a basis). In the case of essential subsets of cardinality 1 (essential elements) we introduce a way to "dessentialize" a basis. As an application, we definitively improve the earlier result of Deschamps and Grekos giving an upper bound of the number of the essential elements of a basis. More precisely, we show that for all basis of order , the number of essential elements of satisfy where , and we show that this inequality is best possible.
Full work available at URL: https://arxiv.org/abs/0802.1205
Recommendations
Goldbach-type theorems; other additive questions involving primes (11P32) Additive bases, including sumsets (11B13)
Cites Work
Cited In (4)
This page was built for publication: Essentialness in additive bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868906)