An improved lower bound for finite additive 2-bases

Jukka Kohonen

doi:10.1016/j.jnt.2016.11.011

An improved lower bound for finite additive 2-bases

Jukka Kohonen

Tutkimustuotos: Lehtiartikkeli › Article › Scientific › vertaisarvioitu

3 Sitaatiot (Scopus)

Abstrakti

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.

Alkuperäiskieli	Englanti
Sivut	518–524
Julkaisu	Journal of Number Theory
Vuosikerta	174
DOI - pysyväislinkit	https://doi.org/10.1016/j.jnt.2016.11.011
Tila	Julkaistu - toukok. 2017
OKM-julkaisutyyppi	A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Pääsy asiakirjaan

10.1016/j.jnt.2016.11.011

https://arxiv.org/abs/1606.04770Lisenssi: Muu

TAPEASE: Theory and Practice of Advance Search and Enumeration
Kaski, P. (Vastuullinen tutkija) & Kohonen, J. (Projektin jäsen)
01/01/2014 → 31/01/2019
Projekti: EU: ERC grants

Siteeraa tätä

@article{bfcdee8adb2145b381f033a6292b63e5,

title = "An improved lower bound for finite additive 2-bases",

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.",

keywords = "Finite additive basis, Additive number theory",

author = "Jukka Kohonen",

year = "2017",

month = may,

doi = "10.1016/j.jnt.2016.11.011",

language = "English",

volume = "174",

pages = "518–524",

journal = "Journal of Number Theory",

issn = "0022-314X",

publisher = "Elsevier",

}

TY - JOUR

T1 - An improved lower bound for finite additive 2-bases

AU - Kohonen, Jukka

PY - 2017/5

Y1 - 2017/5

N2 - 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.

AB - 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.

KW - Finite additive basis

KW - Additive number theory

U2 - 10.1016/j.jnt.2016.11.011

DO - 10.1016/j.jnt.2016.11.011

M3 - Article

SN - 0022-314X

VL - 174

SP - 518

EP - 524

JO - Journal of Number Theory

JF - Journal of Number Theory

ER -

An improved lower bound for finite additive 2-bases

Abstrakti

Pääsy asiakirjaan

Sormenjälki

Projektit

TAPEASE: Theory and Practice of Advance Search and Enumeration

Siteeraa tätä