The sphere packing problem in dimension 24
Reads0
Chats0
TLDR
In this article, it was shown that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic packing.Abstract:
Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic packing. In particular, we find an optimal auxiliary function for the linear programming bounds, which is an analogue of Viazovska's function for the eight-dimensional case.read more
Citations
More filters
Posted Content
Isodiametry, variance, and regular simplices from particle interactions.
Tongseok Lim,Robert J. McCann +1 more
TL;DR: In this paper, it was shown that the minimum energy configuration is uniquely attained by equidistributing the particles over the vertices of a regular top-dimensional simplex (i.e. an equilateral triangle in two dimensions and a regular tetrahedron in three).
Posted Content
Decentralized Attribution of Generative Models
Changhoon Kim,Yi Ren,Yezhou Yang +2 more
TL;DR: It is shown that decentralized attribution can be achieved when keys are (1) orthogonal to each other, and (2) belonging to a subspace determined by the data distribution, and this result is validated on MNIST and CelebA.
Posted Content
High-density hard-core model on triangular and hexagonal lattices
TL;DR: In this article, the Gibbs statistics of high-density hard-core random configurations on a unit triangular lattice and a unit honeycomb graph were studied for any value of the (Euclidean) repulsion diameter.
Posted Content
An optimal uncertainty principle in twelve dimensions via modular forms
TL;DR: In the case of the Eisenstein series, it has been shown that the optimal bound in twelve dimensions for the uncertainty principle of Bourgain, Clozel, and Kahane is sharp as mentioned in this paper, and the construction of a function attaining the bound is based on Viazovska's modular form techniques.
Journal ArticleDOI
A combinatorial approach to small ball inequalities for sums and differences
Jiange Li,Mokshay Madiman +1 more
TL;DR: In this article, a collection of inequalities relating different small-ball probabilities for sums or differences of independent, identically distributed random elements taking values in very general sets is presented. But these inequalities are of extremal combinatorial nature, related among other things to classical packing problems such as the kissing number problem.
References
More filters
Journal ArticleDOI
Handbook of Mathematical Functions with Formulas
TL;DR: The Handbook of Mathematical Functions with Formulas (HOFF-formulas) as mentioned in this paper is the most widely used handbook for mathematical functions with formulas, which includes the following:
Book
Tata Lectures on Theta I
TL;DR: In this paper, theta functions in one variable and motivation: motivation and theta function in several variables are compared. But the results are limited to one variable, and motivation is not considered.
Posted Content
Sphere packings I
TL;DR: A program to prove the Kepler conjecture on sphere packings is described and it is shown that every Delaunay star that satisfies a certain regularity condition satisfies the conjecture.
Journal ArticleDOI
Spherical codes and designs
TL;DR: In this paper, the authors provided an overview of spherical codes and designs, and derived bounds for the cardinality of spherical A-codes in terms of the Gegenbauer coefficients of polynomials compatible with A.
BookDOI
The Selberg trace formula for PSL (2, IR)
TL;DR: The selberg trace formula (version A) as mentioned in this paper is a trace formula for the Poincare series and the spectral decomposition of L2(? \H,?).