Pages that link to "Item:Q1258520"

The following pages link to New bounds on the number of unit spheres that can touch a unit sphere in n dimensions (Q1258520):

Displaying 50 items.

• Apollonian ball packings and stacked polytopes (Q309645) (← links)
• The strong thirteen spheres problem (Q443916) (← links)
• Delsarte method in the problem on kissing numbers in high-dimensional spaces (Q483413) (← links)
• t-designs in projective spaces (Q594880) (← links)
• Bounds for solid angles of lattices of rank three (Q618321) (← links)
• Rigidity of spherical codes (Q658415) (← links)
• An application of kissing number in sum-product estimates (Q722350) (← links)
• Towards a proof of the 24-cell conjecture (Q722369) (← links)
• Bounds for codes by semidefinite programming (Q735630) (← links)
• The Tietäväinen bound for spherical codes (Q759729) (← links)
• Linear programming bounds for regular graphs (Q897255) (← links)
• Optimality and uniqueness of the Leech lattice among lattices (Q972558) (← links)
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps (Q1011505) (← links)
• A survey on spherical designs and algebraic combinatorics on spheres (Q1039420) (← links)
• Sphericity exceeds cubicity for almost all complete bipartite graphs (Q1077426) (← links)
• Finite sphere packing and sphere covering (Q1111159) (← links)
• Comparing the biased choice model and multidimensional decision bound models of identification (Q1185294) (← links)
• On spherical codes generating the kissing number in dimensions 8 and 24 (Q1199603) (← links)
• Designs as maximum codes in polynomial metric spaces (Q1201908) (← links)
• Nonexistence of certain symmetric spherical codes (Q1209225) (← links)
• On the extremality of the polynomials used for obtaining the best known upper bounds for the kissing numbers (Q1321691) (← links)
• Extremal dispositions of the points on the sphere (Q1375048) (← links)
• Upper bounds for \(s\)-distance sets and equiangular lines (Q1644979) (← links)
• On kissing numbers and spherical codes in high dimensions (Q1669035) (← links)
• On contact graphs of totally separable packings in low dimensions (Q1795497) (← links)
• Extremal polynomials for obtaining bounds for spherical codes and designs (Q1895969) (← links)
• The 123 theorem and its extensions (Q1903015) (← links)
• The kissing numbers of tetrahedra (Q1913596) (← links)
• Almost impossible \(E_8\) and Leech lattices (Q2076003) (← links)
• Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\) (Q2134559) (← links)
• Upper bounds for energies of spherical codes of given cardinality and separation (Q2200514) (← links)
• Contact graphs of ball packings (Q2200926) (← links)
• Embryonic cleavage modeling as a computational approach to sphere packing problem (Q2209910) (← links)
• The Cartan-Hadamard conjecture and the little prince (Q2329588) (← links)
• Sphere packings revisited (Q2493106) (← links)
• The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space (Q2516599) (← links)
• A short solution of the kissing number problem in dimension three (Q2689252) (← links)
• Invariant Semidefinite Programs (Q2802527) (← links)
• The Tammes Problem for <i>N</i> = 14 (Q3194582) (← links)
• Universally optimal distribution of points on spheres (Q3420216) (← links)
• New upper bounds for kissing numbers from semidefinite programming (Q3577299) (← links)
• The densest lattice in twenty-four dimensions (Q4681006) (← links)
• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry (Q4689862) (← links)
• Exact Semidefinite Programming Bounds for Packing Problems (Q4989941) (← links)
• Kissing number in non-Euclidean spaces of constant sectional curvature (Q4999491) (← links)
• Birds on a wire (Q5055388) (← links)
• Geometrical Bounds for Variance and Recentered Moments (Q5076700) (← links)
• A Combinatorial Approach to Small Ball Inequalities for Sums and Differences (Q5219313) (← links)
• Improved Lower Bounds for Kissing Numbers in Dimensions 25 through 31 (Q5351869) (← links)
• Bounds for spherical codes: The Levenshtein framework lifted (Q5856745) (← links)