Three-point bounds for energy minimization

Mathematics – Metric Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

29 pages

Scientific paper

Three-point semidefinite programming bounds are one of the most powerful known tools for bounding the size of spherical codes. In this paper, we use them to prove lower bounds for the potential energy of particles interacting via a pair potential function. We show that our bounds are sharp for seven points in RP^2. Specifically, we prove that the seven lines connecting opposite vertices of a cube and of its dual octahedron are universally optimal. (In other words, among all configurations of seven lines through the origin, this one minimizes energy for all potential functions that are completely monotonic functions of squared chordal distance.) This configuration is the only known universal optimum that is not distance regular, and the last remaining universal optimum in RP^2. We also give a new derivation of semidefinite programming bounds and present several surprising conjectures about them.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Three-point bounds for energy minimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Three-point bounds for energy minimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Three-point bounds for energy minimization will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-475279

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.