21 citations · 48 across the 26 of their papers we have counts for
30 papers
New bounds on the covering radius of orthogonal arrays of even strength
Peter Boyvalenkov, Ferruh Ozbudak, Maya Stoyanova
We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength . Our LP bounds develop in two alternative scenari…
Universal polar dual pairs]{Universal polar dual pairs of spherical codes found in and the Leech lattice
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…
Universal optimality of -avoiding spherical codes and designs
P. G. Boyvalenkov, D. D. Cherkashin, P. D. Dragnev
Given an open set , we introduce the concepts of -avoiding spherical codes and designs, that is, spherical codes that have no inner products in the set . We…
Bounds on Discrete Potentials of Spherical (k,k)-Designs
S. Borodachov, P. Boyvalenkov, P. Dragnev. D. Hardin. E. Saff +1
We derive universal lower and upper bounds for max-min and min-max problems (also known as polarization) for the potential of spherical -designs and provide certain examples…
Energy bounds for weighted spherical codes and designs via linear programming
Sergiy Borodachov, Peter Boyvalenkov, Peter Dragnev +3
Universal bounds for the potential energy of weighted spherical codes are obtained by linear programming. The universality is in the sense of Cohn-Kumar -- every attaining code is…
The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
Peter Boyvalenkov, Danila Cherkashin
We prove that the kissing number in 48 dimensions among antipodal spherical codes with certain forbidden inner products is 52\,416\,000. Constructions of attaining codes as kissing…