Upper bounds for finite additive $2$-bases
Author:
Open Access
- 18 July 2008
- journal article
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 137 (01) , 11-18
Abstract
For a positive integer , a set <!-- MATH $\mathcal{A}\subset [0,N]\cap\mathbb{Z}$ --> is called a -basis for if every integer <!-- MATH $n\in [0,N]$ --> can be represented as , where <!-- MATH $a, b\in\mathcal{A}$ --> . In this paper, we give a lower bound estimate for the cardinality of an additive -basis for , as <!-- MATH $N\to\infty$ --> , which improves the existing results on this topic.
Keywords
This publication has 6 references indexed in Scilit:
- An upper bound for setsJournal of Number Theory, 2007
- A new upper bound for finite additive basesActa Arithmetica, 2006
- Thin Bases of Order TwoJournal of Number Theory, 2001
- Untere Schranken für die Reichweiten von Extremalbasen fester OrdnungAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1979
- Eine obere Schranke für die Reichweite einer Extremalbasis zweiter Ordnung.Journal für die reine und angewandte Mathematik (Crelles Journal), 1969
- Ein Beitrag zur additiven ZahlentheorieMathematische Zeitschrift, 1937