11 problems
Let denote the root lattice in dimension . A lattice is a locally optimal solution to the lattice packing-covering problem if no sufficiently small deformation im…
A perfect form is a positive definite quadratic form whose associated Delone subdivision is determined by its minimal vectors; Voronoi's first perfect form is the first form in Vor…
Reciprocal counting-function conjecture. For every , one has
Weighted counting-function conjecture. For , one has
Schmutz Schaller's counting-function conjecture. For every , one has
For a convex body , let be the non-separable lattice quantity defined in the source. The Makai extremal conjecture. … with equality possible onl…
A lattice packing in has density bounded above by the lattice three-point bound, obtained from a semidefinite-programming formulation of the three-point bound. Sharp…
Let be a formally self-dual code of length . Let be the polynomial associated with a formally self-dual code , and let…
Let be a formally unimodular packing, and let denote its secrecy function and its maximum value. Formally unimodular packing secrecy fu…
Single-class HCP conjecture. All EPGMs are generated by PCs from a single equivalence class. This class has cardinality and consists of -HCP configurations and th…
Let be a hexameral domain with multi-curve around its boundary. Let be the parameters defining the non-repeating boundary interval. Suppose that the entire n…