An upper bound for B2[2] sequences

被引：7
作者：
Cilleruelo, J [1 ]
机构：
[1] Univ Autonoma Madrid, Dept Matemat, E-28049 Madrid, Spain
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES A | 2000年 / 89卷 / 01期
关键词：
D O I：
10.1006/jcta.1999.3012
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We introduce a new counting method to deal with B-2[2] sequences, getting a new upper bound for the size of these sequences, F(N, 2) less than or equal to root 6N + 1. (C) 2000 Academic Press.
引用
收藏
页码：141 / 144
页数：4
相关论文
共 6 条
  • [1] CILLERUELO J, UPPER LOWER BOUNDS F
  • [2] ERDOS P, 1994, MAT LAPOK, V1
  • [3] Erdos P., 1941, J. London Math. Soc., V16, P212, DOI [10.1112/jlms/s1-16.4.212, DOI 10.1112/JLMS/S1-16.4.212]
  • [4] The density of B-h[g] sequences and the minimum of dense cosine sums
    Kolountzakis, MN
    [J]. JOURNAL OF NUMBER THEORY, 1996, 56 (01) : 4 - 11
  • [5] KOLOUNTZAKIS MN, 1991, NUMBER THEORY
  • [6] SARKOZY A, 1996, MATH P ERDOS, V1
1