Three years ago, Maryna Viazovska, of the Swiss Federal Institute of Technology in Lausanne, dazzled mathematicians by identifying the densest way to pack equal-sized spheres in eight- and 24-dimensional space (the second of these in collaboration with four co-authors). Now, she and her co-authors have proved something even more remarkable: The configurations that solve the sphere-packing problem in those two dimensions also solve an infinite number of other problems about the best arrangement for points that are trying to avoid each other.

The points could be an infinite collection of electrons, for example, repelling each other and trying to settle into the lowest-energy configuration. Or the points could represent the centers of long, twisty polymers in a solution, trying to position themselves so they won’t bump into their neighbors. There’s a host of different such problems, and it’s not obvious why they should all have the same solution. In most dimensions, mathematicians don’t believe this is remotely likely to be true.

But dimensions eight and 24 each contain a special, highly symmetric point configuration that, we now know, simultaneously solves all these different problems. In the language of mathematics, these two configurations are “universally optimal.”

The sweeping new finding vastly generalizes Viazovska and her collaborators’ previous work. “The fireworks have not stopped,” said Thomas Hales, a mathematician at the University of Pittsburgh who in 1998 proved that the familiar pyramidal stacking of oranges is the densest way to pack spheres in three-dimensional space.

Eight and 24 now join dimension one as the only dimensions known to have universally optimal configurations. In the two-dimensional plane, there’s a candidate for universal optimality — the equilateral triangle lattice — but no proof. Dimension three, meanwhile, is a zoo: Different point configurations are better in different circumstances, and for some problems, mathematicians don’t even have a good guess for what the best configuration is.

“You change the dimension or you change the problem a little bit and then things may be completely unknown,” said Richard Schwartz, a mathematician at Brown University in Providence. “I don’t know why the mathematical universe is built this way.”

Proving universal optimality is much harder than solving the sphere-packing problem. That’s partly because universal optimality encompasses infinitely many different problems at once, but also because the problems themselves are harder. In sphere packing, each sphere cares only about the location of its nearest neighbors, but for something like electrons scattered through space, every electron interacts with every other electron, no matter how far apart they are. “Even in light of the earlier work, I would not have expected this [universal optimality proof] to be possible to do,” Hales said.

“I’m very, very impressed,” said Sylvia Serfaty, a mathematician at New York University. “It’s at the level of the big 19th-century mathematics breakthroughs.”

A Magic Certificate

It might seem strange that dimensions eight and 24 should behave differently from, say, dimension seven or 18 or 25. But mathematicians have long known that packing objects into space works differently in different dimensions. For instance, consider a higher-dimensional sphere, defined simply as the collection of points some fixed distance from a center point. If you compare the sphere’s volume to that of the smallest cube that fits around it, the sphere fills up less and less of the cube as you go up in dimension. If you wanted to ship an eight-dimensional soccer ball in the smallest possible box, the ball would fill less than 2 percent of the box’s volume — the rest would be wasted space.

In each dimension higher than three, it’s possible to construct a configuration analogous to the pyramidal orange arrangement, and as the dimension increases, the gaps between the spheres grow. When you hit dimension eight, there’s suddenly enough room to fit new spheres into the gaps. Doing so produces a highly symmetric configuration called the E8 lattice. Likewise, in dimension 24, the Leech lattice arises from fitting extra spheres into the gaps in another well-understood sphere packing.

For reasons mathematicians don’t fully understand, these two lattices crop up in one area of mathematics after another, from number theory to analysis to mathematical physics. “I don’t know of a single root cause for everything,” said Henry Cohn, of Microsoft Research New England in Cambridge, Mass., one of the new paper’s five authors.

For more than a decade, mathematicians have had strong numerical evidence suggesting that E8 and the Leech lattice are universally optimal in their respective dimensions — but until recently they had no idea how to prove it. Then in 2016, Viazovska took the first step by proving that these two lattices are the best possible sphere packings (she was joined, for the Leech lattice proof, by Cohn and the other three authors of the new paper: Abhinav Kumar, Stephen Miller of Rutgers University and Danylo Radchenko of the Max Planck Institute for Mathematics in Bonn, Germany).

While Hales’ proof for the three-dimensional case filled hundreds of pages and required extensive computer calculations, Viazovska’s E8 proof came in at just 23 pages. The core of her argument involved identifying a “magic” function (as mathematicians have come to call it) that provided what Hales called a “certificate” that E8 is the best sphere packing — a proof that might be hard to come up with, but that once found carries instant conviction. For example, if someone asked you whether any real number x makes the polynomial x2 – 6x + 9 negative, you might be hard-pressed to reply. But if you realized that the polynomial equals (x – 3)2, you would immediately know that the answer is no, since squared numbers are never negative.

Viazovska’s magic function method was powerful — almost too powerful, in fact. The sphere-packing problem only cares about interactions between nearby points, but Viazovska’s approach seemed as if it might work for long-range interactions as well, like those between distant electrons.

High-Dimensional Uncertainty

To show that a configuration of points in space is universally optimal, one must first specify the universe in question. No point configuration is optimal with respect to every single goal: For instance, when an attractive force acts on the points, the lowest-energy configuration will not be some lattice but just a massive pileup, with all the points at the same spot.

Viazovska, Cohn and their collaborators restricted their attention to the universe of repulsive forces. More specifically, they considered ones that are completely monotonic, meaning (among other things) that the repulsion is stronger when points are closer to each other. This broad family includes many of the forces most common in the physical world. It includes inverse power laws — such as Coulomb’s inverse square law for electrically charged particles — and Gaussians, the bell curves that capture the behavior of entities with many essentially independent repelling parts, such as long polymers. The sphere-packing problem sits at the outer edge of this universe: The requirement that the spheres not overlap translates into an infinitely strong repulsion when their center points are closer together than the diameter of the spheres.

For any one of these completely monotonic forces, the question becomes, what is the lowest-energy configuration — the “ground state” — for an infinite collection of particles? In 2006, Cohn and Kumar developed a method for finding lower bounds on the energy of the ground state by comparing the energy function to smaller “auxiliary” functions with especially nice properties. They found an infinite supply of auxiliary functions for each dimension, but they didn’t know how to find the best auxiliary function.