Related papers: A Breakthrough in Sphere Packing: The Search for M…
This expository paper describes Viazovska's breakthrough solution of the sphere packing problem in eight dimensions, as well as its extension to twenty-four dimensions by Cohn, Kumar, Miller, Radchenko, and Viazovska.
A brief report on recent work on the sphere-packing problem.
In 2016, Viazovska famously solved the sphere packing problem in dimension $8$, using modular forms to construct a 'magic' function satisfying optimality conditions determined by Cohn and Elkies in 2003. In March 2024, Hariharan and…
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 has consequences far beyond the problems that originally…
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 extremal problems and interpolation problems in Fourier analysis.…
The Apollonian circle packing, generated from three mutually-tangent circles in the plane, has inspired over the past half-century the study of other classes of space-filling packings, both in two and in higher dimensions. Recently,…
We study some sequences of functions of one real variable and conjecture that they converge uniformly to functions with certain positivity and growth properties. Our conjectures imply a conjecture of Cohn and Elkies, which in turn implies…
We generalize the recent work of Viazovska by constructing infinite families of Schwartz functions, suitable for Cohn-Elkies style linear programming bounds, using quasi-modular and modular forms. In particular for dimensions $d \equiv 0…
In this paper we study crystallographic sphere packings and Kleinian sphere packings, introduced first by Kontorovich and Nakamura in 2017 and then studied further by Kapovich and Kontorovich in 2021. In particular, we solve the problem of…
We continue the study of the linear programming bounds for sphere packing introduced by Cohn and Elkies. We use theta series to give another proof of the principal theorem, and present some related results and conjectures.
How should you choose a good set of (say) 48 planes in four dimensions? More generally, how do you find packings in Grassmannian spaces? In this article I give a brief introduction to the work that I have been doing on this problem in…
The aim of this paper is to review and discuss qualitatively some results on the properties of amorphous packings of hard spheres that were recently obtained by means of the replica method. The theory gives predictions for the equation of…
The past few years have seen dramatic breakthroughs and spectacular and puzzling discoveries in astrophysics and cosmology. In many cases, the new observations can only be explained with the introduction of new fundamental physics. Here we…
Recent years have seen dramatic progress in cosmology and particle astrophysics. So much so that anyone who dares to offer an overview would certainly risk him- or herself for being incomplete and biased at best, and even incorrect due to…
We improve the previously best known upper bounds on the sizes of $\theta$-spherical codes for every $\theta<\theta^*\approx 62.997^{\circ}$ at least by a factor of $0.4325$, in sufficiently high dimensions. Furthermore, for sphere packing…
Astroparticle physics is undergoing a profound transformation, due to a series of extraordinary new results, such as the discovery of high-energy cosmic neutrinos with IceCube, the direct detection of gravitational waves with LIGO and…
This article is a gentle introduction to the mathematical area known as circle packing, the study of the kinds of patterns that can be formed by configurations of non-overlapping circles. The first half of the article is an exposition of…
This summary is organized into four parts. In the first section (News) I discuss the SuperKamiokande results on atmospheric neutrino oscillations, as well as recent results from cosmology. The second section (Refinements) focuses on…
Using graph-theoretic methods we give a new proof that for all sufficiently large $n$, there exist sphere packings in $\R^n$ of density at least $cn2^{-n}$, exceeding the classical Minkowski bound by a factor linear in $n$. This matches up…
A variant of the Circle Packing Theorem states that the combinatorial class of any convex polyhedron contains elements midscribed to the unit sphere centered at the origin, and that these representatives are unique up to M\"obius…