The bin packing problem is a well-studied problem in combinatorial optimization. In the
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …

The sphere packing problem in dimension 24 Page 1 Annals of Mathematics 185 (2017),
1017–1033 https://doi.org/10.4007/annals.2017.185.3.8 The sphere packing problem in …

We establish a precise relation between the modular bootstrap, used to con-strain the
spectrum of 2D CFTs, and the sphere packing problem in Euclidean geometry. The modular …

The Cohn-Kumar conjecture states that the triangular lattice in dimension 2, the $ E_8 $
lattice in dimension 8, and the Leech lattice in dimension 24 are universally minimizing in …

Abstract On July 5th, 2022, Maryna Viazovska was awarded a Fields Medal for her solution
of the sphere packing problem in eight dimensions, as well as further contributions to related …

In random sequential covering, identical objects are deposited randomly, irreversibly, and
sequentially; only attempts increasing the coverage are accepted. A finite system eventually …

While the author is a professional mathematician, he is by no means an expert in the subject
area of these notes. The goal of these notes is to share the author's personal excitement …

Viazovska's solution of the sphere packing problem in eight dimensions is based on a
remarkable construction of certain special functions using modular forms. Great mathematics …

Eigenfunctions of the Fourier transform with prescribed zeros played a major role in the
proof that the E8 and the Leech lattice give the best sphere packings in respective …

Begins with an introduction to the theory of functions of a complex variable, covers complex
numbers and their properties, analytic functions and the Cauchy–Riemann equations, the …