Finite sets of operations sufficient to construct any fullerene from C 20
- 116 Downloads
We study the well-known problem of combinatorial classification of fullerenes. By a (mathematical) fullerene we mean a convex simple three-dimensional polytope with all facets pentagons and hexagons. We analyse approaches of construction of arbitrary fullerene from the dodecahedron (a fullerene C 20). A growth operation is a combinatorial operation that substitutes the patch with more facets and the same boundary for the patch on the surface of a simple polytope to produce a new simple polytope. It is known that an infinite set of different growth operations transforming fullerenes into fullerenes is needed to construct any fullerene from the dodecahedron. We prove that if we allow a polytope to contain one exceptional facet, which is a quadrangle or a heptagon, then a finite set of growth operations is sufficient. We analyze pairs of objects: a finite set of operations, and a family of acceptable polytopes containing fullerenes such that any polytope of the family can be obtained from the dodecahedron by a sequence of operations from the corresponding set. We describe explicitly three such pairs. First two pairs contain seven operations, and the last – eleven operations. Each of these operations corresponds to a finite set of growth operations and is a composition of edge- and two edges-truncations.
KeywordsFullerenes Growth operations Finite sets Polytopes Edge-truncations Dodecahedron
This work is supported by the Russian Science Foundation under grant 14-11-00414. The second author is a Young Russian Mathematics award winner.
Compliance with Ethical Standards
Conflict of interest
The authors declare that they have no conflict of interest.
- 1.Lord EA, Mackay AL, Ranganathan S (2006) New geometries for new materials. University Press, CambridgeGoogle Scholar
- 2.Grünbaum B (2003) Convex polytopes (2nd Edition). Graduate texts in mathematics 221. Springer, New YorkGoogle Scholar
- 3.Ziegler GM (2007) Lectures on polytopes (7th Printing). Graduate texts in mathematics, 152, SpringerGoogle Scholar
- 4.Curl RF (1996) Dawn of the fullerenes: experiment and conjecture, Nobel LectureGoogle Scholar
- 5.Kroto H (1996) Symmetry, space, stars and C 60, Nobel LectureGoogle Scholar
- 6.Smalley RE (1996) Discovering the fullerenes. Nobel LectureGoogle Scholar
- 16.Andova V, Kardoš F, Škrekovski R (2016) Mathematical aspects of fullerenes. Ars Mat. Contemp. 11:353–379Google Scholar
- 18.Eberhard V (1891) Zur Morphologie der Polyheder. LeipzigGoogle Scholar
- 19.Brückner M (1900) Vielecke und Vielflache. LeipzigGoogle Scholar
- 20.Erokhovets NY (2015) k-belts and edge cycles of simple 3-polytopes with at most hexagonal facets (in russian). Far Eastern Math J 15(2):197–213Google Scholar
- 27.Buchstaber VM, Erokhovets NY (2015) Construction of fullerenes. arXiv:http://arxiv.org/abs/1510.02948
- 28.Buchstaber VM, Erokhovets NY (2016) Fullerenes, polytopes and toric topology. Lecture Note Series, IMS, NUS, Singapore. arXiv:http://arxiv.org/abs/1609.02949