A finite set X in a complex sphere is called a complex spherical 2-code if the number of inner products between two distinct vectors in X is equal to 2. In this paper, we characterize the tight complex spherical 2-codes by doubly regular tournaments or skew Hadamard matrices. We also give certain maximal 2-codes relating to skew-symmetric D-optimal designs. To prove them, we show the smallest embedding dimension of a tournament into a complex sphere by the multiplicity of the smallest or second-smallest eigenvalue of the Seidel matrix
We derive and investigate lower bounds for the potential energy of finite spherical point sets (sphe...
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new uppe...
AbstractLinear programming bounds provide an elegant method to prove optimality and uniqueness of an...
Let X be a nite set in a complex sphere of d dimension. Let D(X) be the set of usual inner products...
Traditionally, optimality and uniqueness of an (n,N,t) spherical code is proved using linear program...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
For many extremal configurations of points on a sphere, the linear programming approach can be used ...
Spherical codes in even dimensions n = 2m generated by a commutative group of orthogonal matrices ca...
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement o...
We show that commutative group spherical codes in R(n), as introduced by D. Slepian, are directly re...
In this work we search for spherical codes in three to five dimensions using different global optimi...
This thesis concentrates on a set of problems and approaches relating to the generation and analysis...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Ci...
A spherical code with parameter $(n, N,\gamma)$ is a set of N points on the unit sphere in $n$ dimen...
ABSTRACT. We introduced with C. Bachoc and G. Nebe anotion of design (resp. code) in Grassmannian sp...
We derive and investigate lower bounds for the potential energy of finite spherical point sets (sphe...
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new uppe...
AbstractLinear programming bounds provide an elegant method to prove optimality and uniqueness of an...
Let X be a nite set in a complex sphere of d dimension. Let D(X) be the set of usual inner products...
Traditionally, optimality and uniqueness of an (n,N,t) spherical code is proved using linear program...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
For many extremal configurations of points on a sphere, the linear programming approach can be used ...
Spherical codes in even dimensions n = 2m generated by a commutative group of orthogonal matrices ca...
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement o...
We show that commutative group spherical codes in R(n), as introduced by D. Slepian, are directly re...
In this work we search for spherical codes in three to five dimensions using different global optimi...
This thesis concentrates on a set of problems and approaches relating to the generation and analysis...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Ci...
A spherical code with parameter $(n, N,\gamma)$ is a set of N points on the unit sphere in $n$ dimen...
ABSTRACT. We introduced with C. Bachoc and G. Nebe anotion of design (resp. code) in Grassmannian sp...
We derive and investigate lower bounds for the potential energy of finite spherical point sets (sphe...
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new uppe...
AbstractLinear programming bounds provide an elegant method to prove optimality and uniqueness of an...