Semidefinite programming bounds for spherical three-distance sets

Feng Yuan Liu; Wei Hsuan Yu

doi:10.37236/11979

Semidefinite programming bounds for spherical three-distance sets

Feng Yuan Liu, Wei Hsuan Yu

數學系

研究成果: 雜誌貢獻 › 期刊論文 › 同行評審

摘要

A spherical three-distance set is a collection X of unit vectors in ℝⁿ such that the set of distances between any two distinct vectors has cardinality three. In this paper, we use the semidefinite programming method to improve the upper bounds for spherical three-distance sets in various dimensions. Specifically, we obtain better bounds in ℝ⁷, ℝ²⁰, ℝ²¹, ℝ²³, ℝ²⁴, and ℝ²⁵. Our results show that the maximum size of a spherical three-distance set is 2300 in ℝ²³.

原文	???core.languages.en_GB???
文章編號	P4.11
頁（從 - 到）	4-11
頁數	8
期刊	Electronic Journal of Combinatorics
卷	31
發行號	4
DOIs	https://doi.org/10.37236/11979
出版狀態	已出版 - 2024

存取文件

10.37236/11979

各式樣方法在等角直線叢(2/2)
Yu, W.-H. (PI)
1/08/19 → 31/07/20
研究計畫: Research

引用此

@article{a2e95b0dc0d9451ebbe30277c07496da,

title = "Semidefinite programming bounds for spherical three-distance sets",

abstract = "A spherical three-distance set is a collection X of unit vectors in ℝn such that the set of distances between any two distinct vectors has cardinality three. In this paper, we use the semidefinite programming method to improve the upper bounds for spherical three-distance sets in various dimensions. Specifically, we obtain better bounds in ℝ7, ℝ20, ℝ21, ℝ23, ℝ24, and ℝ25. Our results show that the maximum size of a spherical three-distance set is 2300 in ℝ23.",

author = "Liu, {Feng Yuan} and Yu, {Wei Hsuan}",

note = "Publisher Copyright: {\textcopyright} The authors.",

year = "2024",

doi = "10.37236/11979",

language = "???core.languages.en_GB???",

volume = "31",

pages = "4--11",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

number = "4",

}

TY - JOUR

T1 - Semidefinite programming bounds for spherical three-distance sets

AU - Liu, Feng Yuan

AU - Yu, Wei Hsuan

N1 - Publisher Copyright: © The authors.

PY - 2024

Y1 - 2024

N2 - A spherical three-distance set is a collection X of unit vectors in ℝn such that the set of distances between any two distinct vectors has cardinality three. In this paper, we use the semidefinite programming method to improve the upper bounds for spherical three-distance sets in various dimensions. Specifically, we obtain better bounds in ℝ7, ℝ20, ℝ21, ℝ23, ℝ24, and ℝ25. Our results show that the maximum size of a spherical three-distance set is 2300 in ℝ23.

AB - A spherical three-distance set is a collection X of unit vectors in ℝn such that the set of distances between any two distinct vectors has cardinality three. In this paper, we use the semidefinite programming method to improve the upper bounds for spherical three-distance sets in various dimensions. Specifically, we obtain better bounds in ℝ7, ℝ20, ℝ21, ℝ23, ℝ24, and ℝ25. Our results show that the maximum size of a spherical three-distance set is 2300 in ℝ23.

UR - http://www.scopus.com/inward/record.url?scp=85208094533&partnerID=8YFLogxK

U2 - 10.37236/11979

DO - 10.37236/11979

M3 - 期刊論文

AN - SCOPUS:85208094533

SN - 1077-8926

VL - 31

SP - 4

EP - 11

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 4

M1 - P4.11

ER -

Semidefinite programming bounds for spherical three-distance sets

摘要

存取文件

指紋

專案

各式樣方法在等角直線叢(2/2)

引用此