New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
From MaRDI portal
Publication:1258520
DOI10.1016/0097-3165(79)90074-8zbMath0408.52007OpenAlexW2013083117WikidataQ60587728 ScholiaQ60587728MaRDI QIDQ1258520
N. J. A. Sloane, Andrew M. Odlyzko
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(79)90074-8
Inequalities and extremum problems involving convexity in convex geometry (52A40) Other problems of combinatorial convexity (52A37) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items
Sphericity exceeds cubicity for almost all complete bipartite graphs, Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\), Birds on a wire, Apollonian ball packings and stacked polytopes, 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, Finite sphere packing and sphere covering, The Tammes Problem for N = 14, Geometrical Bounds for Variance and Recentered Moments, The kissing numbers of tetrahedra, t-designs in projective spaces, Extremal dispositions of the points on the sphere, On kissing numbers and spherical codes in high dimensions, Random sequential covering, Bounds for solid angles of lattices of rank three, Improved Lower Bounds for Kissing Numbers in Dimensions 25 through 31, Linear programming bounds for regular graphs, A short solution of the kissing number problem in dimension three, Tammes problem and contact number for spheres in spaces of constant curvature, Upper bounds for energies of spherical codes of given cardinality and separation, The magic of 8 and 24, Contact graphs of ball packings, The strong thirteen spheres problem, Embryonic cleavage modeling as a computational approach to sphere packing problem, Rigidity of spherical codes, Delsarte method in the problem on kissing numbers in high-dimensional spaces, Comparing the biased choice model and multidimensional decision bound models of identification, On spherical codes generating the kissing number in dimensions 8 and 24, Designs as maximum codes in polynomial metric spaces, New upper bounds for kissing numbers from semidefinite programming, Nonexistence of certain symmetric spherical codes, Optimality and uniqueness of the Leech lattice among lattices, Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\), Sphere packings revisited, The densest lattice in twenty-four dimensions, An application of kissing number in sum-product estimates, Towards a proof of the 24-cell conjecture, Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry, On contact graphs of totally separable packings in low dimensions, Invariant Semidefinite Programs, Bounds for codes by semidefinite programming, The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space, Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps, A Combinatorial Approach to Small Ball Inequalities for Sums and Differences, The Tietäväinen bound for spherical codes, Exact Semidefinite Programming Bounds for Packing Problems, Almost impossible \(E_8\) and Leech lattices, A survey on spherical designs and algebraic combinatorics on spheres, Kissing number in non-Euclidean spaces of constant sectional curvature, The Cartan-Hadamard conjecture and the little prince, Universally optimal distribution of points on spheres, Bounds for spherical codes: The Levenshtein framework lifted, On the extremality of the polynomials used for obtaining the best known upper bounds for the kissing numbers
Cites Work
