New upper bounds for kissing numbers from semidefinite programming

被引：84

作者：

Bachoc, Christine ^{[1
]}

Vallentin, Frank ^{[2
]}

机构：

[1] Univ Bordeaux 1, Lab A2X, F-33405 Talence, France

[2] Ctr Wiskunde & Informat, NL-1098 SJ Amsterdam, Netherlands

来源：

JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY | 2008年 / 21卷 / 03期

关键词：

spherical codes; kissing number; semidefinite programming; orthogonal polynomials;

D O I：

10.1090/S0894-0347-07-00589-9

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

[No abstract available]

引用

页码：909 / 924

页数：16

共 24 条

[1]

Andrews GE., 1999, SPECIAL FUNCTIONS, V71

[2]

[Anonymous], 1993, REPRESENTATION LIE G

[3]

[Anonymous], LINEAR INEQUALITIES

[4]

[Anonymous], PHILIPS RES REP S

[5] UNIQUENESS OF CERTAIN SPHERICAL CODES [J].

BANNAI, E ;

SLOANE, NJA .

CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1981, 33 (02) :437-449

[6] CSDP, a C library for semidefinite programming [J].

Borchers, B .

OPTIMIZATION METHODS & SOFTWARE, 1999, 11-2 (1-4) :613-623

[7] Arrangements of 14, 15, 16 and 17 points on a sphere [J].

Böröczky, K ;

Szabó, L .

STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2003, 40 (04) :407-421

[8]

Boroczky K., 2003, DISCRETE GEOMETRY, P111

[9]

Casselman B., 2004, Notices Amer. Math. Soc., V51, P884

[10]

Conway JH., 1988, SPHERE PACKINGS LATT, DOI 10.1007/978-1-4757-2016-7

← 1 2 3 →