scientific article
From MaRDI portal
Publication:3876610
zbMath0436.52011MaRDI QIDQ3876610
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31)
Related Items (31)
The Gaussian core model in high dimensions ⋮ Sphere packings give an explicit bound for the Besicovitch covering theorem ⋮ Extremal polynomials for obtaining bounds for spherical codes and designs ⋮ Upper bounds for \(s\)-distance sets and equiangular lines ⋮ The 123 theorem and its extensions ⋮ The kissing numbers of tetrahedra ⋮ An extremum problem for polynomials and bounds for codes with given distance and diameter ⋮ Wiener's problem for positive definite functions ⋮ High-dimensional sphere packing and the modular bootstrap ⋮ On kissing numbers and spherical codes in high dimensions ⋮ Sphere packing bounds via spherical codes ⋮ Improved Lower Bounds for Kissing Numbers in Dimensions 25 through 31 ⋮ Absolute minima of potentials of certain regular spherical configurations ⋮ НЕКОТОРЫЕ ЭКСТРЕМАЛЬНЫЕ ЗАДАЧИ ГАРМОНИЧЕСКОГО АНАЛИЗА И ТЕОРИИ ПРИБЛИЖЕНИЙ ⋮ Odd strength spherical designs attaining the Fazekas-Levenshtein bound for covering and universal minima of potentials ⋮ Tammes problem and contact number for spheres in spaces of constant curvature ⋮ Upper bounds for energies of spherical codes of given cardinality and separation ⋮ Contact graphs of ball packings ⋮ The strong thirteen spheres problem ⋮ The Delsarte extremal problem for the Jacobi transform ⋮ Designs as maximum codes in polynomial metric spaces ⋮ Optimality and uniqueness of the Leech lattice among lattices ⋮ Sphere packings revisited ⋮ The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space ⋮ On upper bounds for code distance and covering radius of designs in polynomial metric spaces ⋮ Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps ⋮ Sphere packing and quantum gravity ⋮ Energy bounds for codes in polynomial metric spaces ⋮ Almost impossible \(E_8\) and Leech lattices ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ ASYMPTOTIC LINEAR PROGRAMMING LOWER BOUNDS FOR THE ENERGY OF MINIMIZING RIESZ AND GAUSS CONFIGURATIONS
This page was built for publication:
