ERC Advanced Grant · 2023
Packing in Discrete Domains - Geometry and Analysis
The packing problem associated with a family of sets F seeks a large subfamily of pairwise disjoint members of F. When F comprises the unit balls in d-space, this is the sphere packing problem, which for d = 3 was solved by Hales-Ferguson (Kepler’s conjecture). The cases d = 8, 24 have won Viazovska her Fields Medal. Much of discrete mathematics deals with dense packing problems. The asymptotic rate vs. distance problem, may be the most fundamental open problem about error correcting codes. It seeks the densest Hamming-sphere packing in discrete cubes. A linear code is a linear subspace of F_2n. Such codes are important both in theory and in practice. Here, we seek to maximize dim(C), when…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.