The following pages link to Enumerating rigid sphere packings (Q2805266):
Displaying 14 items.
- A linear programming algorithm to test for jamming in hard-sphere packings (Q598132) (← links)
- Rigidity of spherical codes (Q658415) (← links)
- Bell polynomials and modified Bessel functions of half-integral order (Q668107) (← links)
- The properties of mutual arrangements of the sphere in the space (Q1382673) (← links)
- Enumeration of irreducible contact graphs on the sphere (Q2259300) (← links)
- On contact graphs of totally separable domains (Q2316019) (← links)
- Calculating the symmetry number of flexible sphere clusters (Q2327829) (← links)
- Rigidity of packings (Q2519778) (← links)
- Defects and frustration in the packing of soft balls (Q2683579) (← links)
- Enumerating rigid sphere packings (Q2805266) (← links)
- Deriving Finite Sphere Packings (Q3225160) (← links)
- A formula for the number of closest packings of equal spheres having a given repeat period (Q3345367) (← links)
- (Q3784737) (← links)
- On the global minimum of the classical potential energy for clusters bound by many-body forces (Q6189794) (← links)
