Enumerating rigid sphere packings (Q2805266)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6578895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating rigid sphere packings |
scientific article; zbMATH DE number 6578895 |
Statements
10 May 2016
0 references
nanostructures
0 references
nanoparticles
0 references
computational aspects in algebraic geometry
0 references
rigidity and flexibility of structures
0 references
mechanisms
0 references
robots
0 references
0 references
Enumerating rigid sphere packings (English)
0 references
The problem of sphere packings has a long and rich history in mathematics. Here, a short review of associated papers is given first (there are 60 references). Then the exact mathematical definition of the problem and a rigidity of the packing are given. The numerical algorithms used are described and more important results are listed and compared.
0 references
0.8214817047119141
0 references
0.7980672121047974
0 references
0.7823899984359741
0 references
0.782193124294281
0 references
