Das Problem der dreizehn Kugeln
From MaRDI portal
Publication:2650816
Cites work
Cited in
(61)- A survey on spherical designs and algebraic combinatorics on spheres
- Finite point-sets on S 2 with minimum distance as large as possible
- A bibliography of quantifier elimination for real closed fields
- Arrangement of 24 points on a sphere
- A rejoinder to Hale's article
- The status of the Kepler conjecture
- On kissing numbers and spherical codes in high dimensions
- On contact graphs of totally separable packings in low dimensions
- The kissing numbers of tetrahedra
- Contact graphs of unit sphere packings revisited
- Packing twelve spherical caps to maximize tangencies
- Compact packings of space with two sizes of spheres
- The two-eyes lemma: a linking problem for table-top necklaces
- On an SDP relaxation for kissing number
- Upper bounds for energies of spherical codes of given cardinality and separation
- Contact graphs of ball packings
- The six cylinders problem: \(\mathbb{D}_3\)-symmetry approach
- Enumeration of irreducible contact graphs on the sphere
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
- The problem of thirteen spheres -- a proof for undergraduates
- Study of the Kepler's conjecture: the problem of the closest packing
- Sphere packings revisited
- Finite sets of points on a sphere with each nearest to five others
- Improved Delsarte bounds for spherical codes in small dimensions
- A short solution of the kissing number problem in dimension three
- Selected open problems in discrete geometry and optimization
- Symmetry in mathematical programming
- The Tammes problem for N = 14
- Energy and discrepancy of rotationally invariant determinantal point processes in high dimensional spheres
- New upper bounds for kissing numbers from semidefinite programming
- The strong thirteen spheres problem
- Contact numbers for congruent sphere packings in Euclidean 3-space
- Metric Geometries in an Axiomatic Perspective
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- Packing, covering and tiling in two-dimensional spaces
- Delsarte method in the problem on kissing numbers in high-dimensional spaces
- Extremal problems of circle packings on a sphere and irreducible contact graphs
- Face-centered cubic crystallization of atomistic configurations
- Kissing number in non-Euclidean spaces of constant sectional curvature
- INFINITE SYSTEM OF BROWNIAN BALLS: EQUILIBRIUM MEASURES ARE CANONICAL GIBBS
- Globally optimizing small codes in real projective spaces
- Optimal packings of congruent circles on a square flat torus
- Random sequential covering
- Emergence of Wulff-crystals from atomistic systems on the FCC and HCP lattices
- The art of unlocking
- Bounds for solid angles of lattices of rank three
- On the global minimum of the classical potential energy for clusters bound by many-body forces
- Tammes problem and contact number for spheres in spaces of constant curvature
- The magic of 8 and 24
- Optimizers of three-point energies and nearly orthogonal sets
- Rigidity of spherical codes
- Online dominating set and coloring
- Dynamic space packing
- New lower bounds on kissing numbers and spherical codes in high dimensions
- Single-cell 3D genome reconstruction in the haploid setting using rigidity theory
- On generalized kissing numbers of convex bodies
- An application of kissing number in sum-product estimates
- Towards a proof of the 24-cell conjecture
- Variations on five-dimensional sphere packings
- Augmented Lagrangian methods for nonlinear programming with possible infeasibility
- Sphere packing
This page was built for publication: Das Problem der dreizehn Kugeln
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2650816)
