- Upper and lower bounds for the sphere packing density in dimensions 1 through 48 and 56, 64, and 72.
- Upper and lower bounds for the kissing numbers in dimensions 1 through 48 and 72.
- Spherical codes with up to 1024 points in up to 32 dimensions.
- A smaller table of spherical codes with up to 32 points, as well as real projective codes with up to 16 lines.
- Grassmannian codes in up to 16 dimensions.
- Sloane’s tables of spherical point configurations (packings, coverings, designs, maximal volume arrangements, and minimal-energy hard-sphere clusters).
- Upper bounds for the minimal harmonic energy of point configurations on spheres in 3 through 32 dimensions, as well as a list of highlights. This problem generalizes the Thomson problem of minimizing the electrostatic potential energy between point particles on a sphere.
- The spinless modular bootstrap for free bosons, or equivalently the linear programming bound for the sphere packing density.
