8 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…
Let be the positive quadratic form defining the lattice covering studied in the paper, and let lattice coverings in dimension be compared by their covering density.…
Algorithmic verification criterion. The following conditions are equivalent: the configuration is a lattice covering realizing the specified combinatorial…
Algebraic intersection criterion. The arrangement is a lattice covering of if and only if there exists a unimodular transformation…
Minkowski-type criterion for three-dimensional lattice coverings. The arrangement is a lattice covering of if and only if there exist a unimodular t…
Boundary-vertex conjecture. The vertices of lie on the boundary of .
Symmetric minimal covering body classification conjecture. There exists a unimodular transformation such that
For each , let be the lattice defined in Dutour (2005), and let a covering maximum be a lattice whose covering density decreases under perturbation. The covering-de…