Projects per year
Abstract
A set of non-negative integers A is an additive 2-basis with range n, if its sumset A+A contains 0,1,…,n but not n+1. Explicit bases are known with arbitrarily large size |A|=k and n/k²≥2/7>0.2857. We present a more general construction and improve the lower bound to 85/294>0.2891.
Original language | English |
---|---|
Pages (from-to) | 518–524 |
Journal | Journal of Number Theory |
Volume | 174 |
DOIs | |
Publication status | Published - May 2017 |
MoE publication type | A1 Journal article-refereed |
Keywords
- Finite additive basis
- Additive number theory
Fingerprint
Dive into the research topics of 'An improved lower bound for finite additive 2-bases'. Together they form a unique fingerprint.Projects
- 1 Finished
-
TAPEASE: Theory and Practice of Advance Search and Enumeration
01/01/2014 → 31/01/2019
Project: EU: ERC grants