Pages that link to "Item:Q5496785"
From MaRDI portal
The following pages link to Upper bounds for packings of spheres of several radii (Q5496785):
Displaying 27 items.
- A copositive formulation for the stability number of infinite graphs (Q344928) (← links)
- Sphere packing bounds via spherical codes (Q398996) (← links)
- Density bounds for outer parallel domains of unit ball packings (Q492221) (← links)
- New asymptotic bounds on the size of multiple packings of the Euclidean sphere (Q650105) (← links)
- Towards a proof of the 24-cell conjecture (Q722369) (← links)
- Upper bounds on packing density for circular cylinders with high aspect ratio (Q741612) (← links)
- New upper bounds on sphere packings. I (Q1425322) (← links)
- Bounds for local density of sphere packings and the Kepler conjecture (Q1597663) (← links)
- Compact packings of space with two sizes of spheres (Q2022627) (← links)
- Semidefinite programming bounds for the average kissing number (Q2143250) (← links)
- The isostatic conjecture (Q2207598) (← links)
- On the problem of packing spheres in a cube (Q2263331) (← links)
- Pair correlation estimates for the zeros of the zeta function via semidefinite programming (Q2288078) (← links)
- A semidefinite programming hierarchy for packing problems in discrete geometry (Q2349135) (← links)
- New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry (Q2408217) (← links)
- A universal upper bound on density of tube packings in hyperbolic space (Q2496580) (← links)
- High-dimensional sphere packing and the modular bootstrap (Q2660222) (← links)
- On the Turing model complexity of interior point methods for semidefinite programming (Q2821802) (← links)
- Dual linear programming bounds for sphere packing via modular forms (Q5018380) (← links)
- (Q5068007) (← links)
- A recursive Lovász theta number for simplex-avoiding sets (Q5097318) (← links)
- Moment methods in energy minimization: New bounds for Riesz minimal energy problems (Q5217870) (← links)
- A Note on Lattice Packings via Lattice Refinements (Q5374123) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
- New upper bounds for spherical codes and packings (Q6583556) (← links)
- Solving clustered low-rank semidefinite programs arising from polynomial optimization (Q6645951) (← links)
- Dual linear programming bounds for sphere packing via discrete reductions (Q6662442) (← links)