Semidefinite Programming Bounds For Spherical Three-distance Sets

Publication date 4 May 2020

Abstract: A spherical three-distance set is a finite collection

X

of unit vectors in

m a t h b b R^{n}

such that for each pair of distinct vectors has three inner product values. We use the semidefinite programming method to improve the upper bounds of spherical three-distance sets for several dimensions. We obtain better bounds in

m a t h b b R^{7}

,

m a t h b b R^{20}

,

m a t h b b R^{21}

,

m a t h b b R^{23}

,

m a t h b b R^{24}

and

m a t h b b R^{25}

. In particular, we prove that maximum size of spherical three-distance sets is

2300

in

m a t h b b R^{23}

.

This page was built for publication: Semidefinite Programming Bounds For Spherical Three-distance Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6339956)