Pages that link to "Item:Q1258520"
From MaRDI portal
The following pages link to New bounds on the number of unit spheres that can touch a unit sphere in n dimensions (Q1258520):
Displayed 18 items.
- t-designs in projective spaces (Q594880) (← links)
- The Tietäväinen bound for spherical codes (Q759729) (← links)
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps (Q1011505) (← 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)
- 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)
- Sphere packings revisited (Q2493106) (← links)
- Universally optimal distribution of points on spheres (Q3420216) (← links)
- The densest lattice in twenty-four dimensions (Q4681006) (← links)
- Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\) (Q5942008) (← links)