Computability questions in the sphere packing problem
From MaRDI portal
Abstract: We consider the sets of dimensions for which there is an optimal sphere packing with special regularity properties (respectively, a lattice, or a periodic set with a given bound on the number of translations, or an arbitrary periodic set). We show that all these sets are oracle-computable, given an oracle that orders an associated set of spherical codes by increasing Kolmogorov complexity.
This page was built for publication: Computability questions in the sphere packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6420097)
