A new upper bound for B2[2] sets

Alain Plagne

doi:10.1006/jcta.2000.3084

A new upper bound for B₂[2] sets

Alain Plagne

Research output: Contribution to journal › Article › peer-review

Abstract

A new upper bound for the cardinality of finite B₂[2] sets is obtained, namely F₂(N, 2)<2.363584N for N sufficiently large. This improves on a recent result by Cilleruelo.

Original language	English
Pages (from-to)	378-384
Number of pages	7
Journal	Journal of Combinatorial Theory. Series A
Volume	93
Issue number	2
DOIs	https://doi.org/10.1006/jcta.2000.3084
Publication status	Published - 1 Jan 2001

Keywords

B[g] sets
Sidon sets

Access to Document

10.1006/jcta.2000.3084

Cite this

@article{f9eda7cf96b24e36b104fc1c8c45d3ac,

title = "A new upper bound for B2[2] sets",

abstract = "A new upper bound for the cardinality of finite B2[2] sets is obtained, namely F2(N, 2)<2.363584N for N sufficiently large. This improves on a recent result by Cilleruelo.",

keywords = "B[g] sets, Sidon sets",

author = "Alain Plagne",

year = "2001",

month = jan,

day = "1",

doi = "10.1006/jcta.2000.3084",

language = "English",

volume = "93",

pages = "378--384",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

number = "2",

}

TY - JOUR

T1 - A new upper bound for B2[2] sets

AU - Plagne, Alain

PY - 2001/1/1

Y1 - 2001/1/1

N2 - A new upper bound for the cardinality of finite B2[2] sets is obtained, namely F2(N, 2)<2.363584N for N sufficiently large. This improves on a recent result by Cilleruelo.

AB - A new upper bound for the cardinality of finite B2[2] sets is obtained, namely F2(N, 2)<2.363584N for N sufficiently large. This improves on a recent result by Cilleruelo.

KW - B[g] sets

KW - Sidon sets

U2 - 10.1006/jcta.2000.3084

DO - 10.1006/jcta.2000.3084

M3 - Article

AN - SCOPUS:0035255477

SN - 0097-3165

VL - 93

SP - 378

EP - 384

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 2