Kamil Kępiński

The Tammes problem for sixteen points: a computer-assisted proof candidate

Plain summary: the Tammes problem asks how to place N points on a sphere so that the closest pair is as far apart as possible. For N = 16 the best known arrangement (Sloane's D4d configuration) has, as far as we know, no published optimality proof. This record contains a computer...