21 citations · 32 across the 10 of their papers we have counts for
5 papers · 1 filter
Upper bounds for energies of spherical codes of given cardinality and separation
Peter Boyvalenkov, Peter Dragnev, Douglas Hardin +2
We introduce a linear programming framework for obtaining upper bounds for the potential energy of spherical codes of fixed cardinality and minimum distance. Using Hermite interpol…
Energy Bounds for Codes in Polynomial Metric Spaces
Peter Boyvalenkov, Peter Dragnev, Douglas Hardin +2
In this article we present a unified treatment for obtaining bounds on the potential energy of codes in the general context of polynomial metric spaces (PM-spaces). The lower bound…
On spherical codes with inner products in a prescribed interval
P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin +2
We develop a framework for obtaining linear programming bounds for spherical codes whose inner products belong to a prescribed subinterval of . An intricate rela…
A survey on the kissing numbers
Peter Boyvalenkov, Stefan Dodunekov, Oleg R. Musin
The maximum possible number of non-overlapping unit spheres that can touch a unit sphere in dimensions is called kissing number. The problem for finding kissing numbers is clos…
Universal lower bounds for potential energy of spherical codes
P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin +2
We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be im…