Analyse der vierperiodischen Minimalnetze
Analysis of 4-periodic minimal nets
by Alexander Beukemann
Date of Examination:2015-02-11
Date of issue:2015-03-06
Advisor:Prof. Dr. Werner F. Kuhs
Referee:Prof. Dr. Gerhard Scheitler
Referee:Prof. Dr. Heidrun Sowa
Files in this item
Name:A.Beukemann, Analyse der vierperiodischen Mi...pdf
Size:5.64Mb
Format:PDF
Abstract
English
Periodic structures – e. g. crystal structures – are analyzed by means of group theory. The concept of a crystal structure is extendable to the n-dimensional space and the 4-dimensional space groups are known [Brown, Bülow, Neubüser, Wondratscheck, Zassenhaus, 1978]. As quasi-periodic and incommensurate structures can be the result of a projection of a higher - periodic structure, it is also worth to enhance the knowledge about higher-periodic structures by graph theoretical means. Thereby the atoms of a crystal can be assigned to the vertices, and the chemical bonds to the edges of a graph being a periodic net. Minimal nets [Beukemann, Klee, 1992] are nets, where the deletion of any edge together with and its translational equivalent edges results in a structure that is no longer connected. It’s special about a minimal net to have a 1:1 relation to its quotient graph [Chung, Hahn, Klee, 1984] that represents the topology of the net by a finite graph, presenting the adjacency relations between the classes of translational equivalent vertices and edges of the periodic net. 3-periodic minimal nets are analyzed by several authors such as Bonneau, Delgado-Friedrichs, O’Keeffe, Yaghi, Eon. Now the complete class of 4-periodic minimal nets (111 nets) is analyzed by comparing their substructures such as trees, chains, cycles and sub-networks. Net to subnet relations are identified and methods for net conversions are proposed. Different principles for the construction of those structures are applied. The embedding of two nets is discussed in detail. Single cycles of the minimal net 6(3)1 – number 1 of minimal nets with 6 classes of vertices and vertex degree 3 (quotient graph K3,3) – where mapped to polygons of a Penrose pattern. The minimal net 3(4)1 could be embedded into the 4-dimensional space by a “symmetric labelling” of the edges of its quotient graph. A reference work with graphics and cycle class sequences of all 2-, 3- and 4-periodic minimal nets is attached.
Keywords: Periodic structures; quotient graph; minimal nets; cycle classes; periodic nets; reference; 2-periodic minimal nets; 3-periodic minimal nets; 4-periodic minimal nets
Schlagwörter: Periodische Strukturen; Quotientengraph; Minimalnetz; Kreisklassen; Periodische Netze; Referenz; 2-periodische Minimalnetze; 3-periodische Minimalnetze; 4-periodische Minimalnetze