Pregled bibliografske jedinice broj: 483777
Space fullerenes: computer search for new Frank- Kasper structures
Space fullerenes: computer search for new Frank- Kasper structures // Seminar za kombinatornu i diskretnu matematiku, Matematički odsjek
Zagreb, Hrvatska, 2010. (predavanje, domaća recenzija, pp prezentacija, znanstveni)
CROSBI ID: 483777 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Space fullerenes: computer search for new Frank- Kasper structures
Autori
Dutour Sikirić, Mathieu ; Deza, Michel ; Delgado- Friedrichs, Olaf
Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, pp prezentacija, znanstveni
Izvornik
Seminar za kombinatornu i diskretnu matematiku, Matematički odsjek
/ - , 2010
Skup
Seminar za kombinatornu i diskretnu matematiku, Matematički odsjek
Mjesto i datum
Zagreb, Hrvatska, 01.04.2010
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Domaća recenzija
Ključne riječi
fullerene ; Delaney symbol ; enumeration
Sažetak
A Frank-Kasper structure is a 3-periodic tiling of the Euclidean space E^3 by tetrahedra such that the vertex figure of any vertex belongs to 4 specified patterns with, respectively, 20, 24, 26, 28 faces. Those polyhedra correspond to fullerenes with isolated hexagons. Frank-Kasper structures occur in the crystallography of metallic alloys and clathrates but also in the solution of Kelvin's conjecture. A new computer enumeration method has been devised for obtaining Frank-Kasper structures up to 20 cells in a reduced fundamental domain. The method decomposes in two parts: one combinatorial of enumeration of possibilities. Another topological of recognition of the structure by the use of Delaney symbols and the program 3dt. We compared the 84 obtained structure with the known 27 physical structures and the known special constructions by Deza-Shtogrin, Sadoc-Mossieri, Frank-Kasper-Sullivan and Shoemaker-Shoemaker.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
