21 citations · 32 across the 12 of their papers we have counts for
8 papers · 1 filter
Universal polar dual pairs of spherical codes found in and
S. V. Borodachov, P. G. Boyvalenkov, P. D. Dragnev +3
We identify universal polar dual pairs of spherical codes and such that for a large class of potential functions the minima of the discrete -potential of on the…
Rationality of the inner products of spherical -distance -designs for ,
Peter Boyvalenkov, Hiroshi Nozaki, Navid Safaei
We prove that the inner products of spherical -distance -designs with (Delsarte codes) and are rational with the only exception being the icosahedron…
On spherical 4-distance 7-designs
Peter Boyvalenkov, Navid Safaei
We investigate spherical 4-distance 7-designs by studying their distance distributions. We compute these distance distributions and use their product (an integer) to derive certain…
Linear programming bounds for covering radius of spherical designs
Peter Boyvalenkov, Maya Stoyanova
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardi…
On 3-distance spherical 5-designs
Peter Boyvalenkov, Navid Safaei
Inspired by a recently formulated conjecture by Bannai et al. we investigate spherical codes which admit exactly three different distances and are spherical 5-designs. Computing an…
Binary (k,k)-designs
Todorka Alexandrova, Peter Boyvalenkov, Angel Dimitrov
We introduce and investigate binary -designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propos…