We prove that the Cohn-Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn- Triantafillou [Math. Comp. 91 (2021), pp. 491 ...
Euclidean lattices are mathematical objects of increasing interest in the fields of cryptography and error-correcting codes. This doctoral thesis is a study on high-dimensional lattices with the motivation to understand how efficient they are in terms of b ...
We provide new explicit examples of lattice sphere packings in dimensions 54, 55, 162, 163, 486 and 487 that are the densest known so far, using Kummer families of elliptic curves over global function fields.
In some cases, these families of elliptic curve ...
In this text, we will show the existence of lattice packings in a family of dimensions by employing division algebras. This construction is a generalization of Venkatesh's lattice packing result Venkatesh (Int Math Res Notices 2013(7): 1628-1642, 2013). In ...
In this talk we will speak about recent progress on the sphere packing problem. The packing problem can be formulated for a wide class of metric spaces equipped with a measure. An interesting feature of this optimization problem is that a slight change of ...
Finite simplex lattice models are used in different branches of science, e.g., in condensed-matter physics, when studying frustrated magnetic systems and non-Hermitian localization phenomena; or in chemistry, when describing experiments with mixtures. An n ...
Packings of granular materials are complex systems consisting of large sets of particles interacting via contact forces. Their internal structure is interesting for several theoretical and practical reasons, especially when the model system consists in a l ...
