Periodic graph (crystallography)

Last updated
A (large) unit cell of the diamond crystal net; the balls represent carbon atoms and the sticks represent covalent bonds Diamond Cubic-F lattice animation.gif
A (large) unit cell of the diamond crystal net; the balls represent carbon atoms and the sticks represent covalent bonds
A (large) unit cell of the alpha-quartz crystal net; the black balls are silicon atoms and the red ones are oxygen. A-quartz.png
A (large) unit cell of the alpha-quartz crystal net; the black balls are silicon atoms and the red ones are oxygen.

In crystallography, a periodic graph or crystal net is a three-dimensional periodic graph, i.e., a three-dimensional Euclidean graph whose vertices or nodes are points in three-dimensional Euclidean space, and whose edges (or bonds or spacers) are line segments connecting pairs of vertices, periodic in three linearly independent axial directions. There is usually an implicit assumption that the set of vertices are uniformly discrete, i.e., that there is a fixed minimum distance between any two vertices. The vertices may represent positions of atoms or complexes or clusters of atoms such as single-metal ions, molecular building blocks, or secondary building units, while each edge represents a chemical bond or a polymeric ligand.

Contents

Although the notion of a periodic graph or crystal net is ultimately mathematical (actually a crystal net is nothing but a periodic realization of an abelian covering graph over a finite graph [1] ), and is closely related to that of a Tessellation of space (or honeycomb) in the theory of polytopes and similar areas, much of the contemporary effort in the area is motivated by crystal engineering and prediction (design), including metal-organic frameworks (MOFs) and zeolites.

History

A crystal net is an infinite molecular model of a crystal. Similar models existed in Antiquity, notably the atomic theory associated with Democritus, which was criticized by Aristotle because such a theory entails a vacuum, which Aristotle believed nature abhors. Modern atomic theory traces back to Johannes Kepler and his work on geometric packing problems. Until the twentieth century, graph-like models of crystals focused on the positions of the (atomic) components, and these pre-20th century models were the focus of two controversies in chemistry and materials science.

The two controversies were (1) the controversy over Robert Boyle’s corpuscular theory of matter, which held that all material substances were composed of particles, and (2) the controversy over whether crystals were minerals or some kind of vegetative phenomenon. [2] During the eighteenth century, Kepler, Nicolas Steno, René Just Haüy, and others gradually associated the packing of Boyle-type corpuscular units into arrays with the apparent emergence of polyhedral structures resembling crystals as a result. During the nineteenth century, there was considerably more work done on polyhedra and also of crystal structure, notably in the derivation of the Crystallographic groups based on the assumption that a crystal could be regarded as a regular array of unit cells. During the early twentieth century, the physics and chemistry community largely accepted Boyle's corpuscular theory of matter—by now called the atomic theory—and X-ray crystallography was used to determine the position of the atomic or molecular components within the unit cells (by the early twentieth century, unit cells were regarded as physically meaningful).

However, despite the growing use of stick-and-ball molecular models, the use of graphical edges or line segments to represent chemical bonds in specific crystals have become popular more recently, and the publication of [3] encouraged efforts to determine graphical structures of known crystals, to generate crystal nets of as yet unknown crystals, and to synthesize crystals of these novel crystal nets. The coincident expansion of interest in tilings and tessellations, especially those modeling quasicrystals, and the development of modern Nanotechnology, all facilitated by the dramatic increase in computational power, enabled the development of algorithms from computational geometry for the construction and analysis of crystal nets. Meanwhile, the ancient association between models of crystals and tessellations has expanded with Algebraic topology. There is also a thread of interest in the very-large-scale integration (VLSI) community for using these crystal nets as circuit designs. [4]

Basic formulation

A Euclidean graph in three-dimensional space is a pair (V, E), where V is a set of vertices (sometimes called points or nodes) and E is a set of edges (sometimes called bonds or spacers) where each edge joins two vertices. There is a tendency in the polyhedral and chemical literature to refer to geometric graphs as nets (contrast with polyhedral nets), and the nomenclature in the chemical literature differs from that of graph theory. [5]

Symmetries and periodicity

A symmetry of a Euclidean graph is an isometry of the underlying Euclidean space whose restriction to the graph is an automorphism; the symmetry group of the Euclidean graph is the group of its symmetries. A Euclidean graph in three-dimensional Euclidean space is periodic if there exist three linearly independent translations whose restrictions to the net are symmetries of the net. Often (and always, if one is dealing with a crystal net), the periodic net has finitely many orbits, and is thus uniformly discrete in that there exists a minimum distance between any two vertices.

The result is a three-dimensional periodic graph as a geometric object.

The resulting crystal net will induce a lattice of vectors so that given three vectors that generate the lattice, those three vectors will bound a unit cell, i.e. a parallelepiped which, placed anywhere in space, will enclose a fragment of the net that repeats in the directions of the three axes.

Symmetry and kinds of vertices and edges

Two vertices (or edges) of a periodic graph are symmetric if they are in the same orbit of the symmetry group of the graph; in other words, two vertices (or edges) are symmetric if there is a symmetry of the net that moves one onto the other. In chemistry, there is a tendency to refer to orbits of vertices or edges as “kinds” of vertices or edges, with the recognition that from any two vertices or any two edges (similarly oriented) of the same orbit, the geometric graph “looks the same”. Finite colorings of vertices and edges (where symmetries are to preserve colorings) may be employed.

The symmetry group of a crystal net will be a (group of restrictions of a) crystallographic space group, and many of the most common crystals are of very high symmetry, i.e. very few orbits. A crystal net is uninodal if it has one orbit of vertex (if the vertices were colored and the symmetries preserve colorings, this would require that a corresponding crystal have atoms of one element or molecular building blocks of one compound – but not vice versa, for it is possible to have a crystal of one element but with several orbits of vertices). Crystals with uninodal crystal nets include cubic diamond and some representations of quartz crystals. Uninodality corresponds with isogonality in geometry and vertex-transitivity in graph theory, and produces examples objective structures. [6] A crystal net is binodal if it has two orbits of vertex; crystals with binodal crystal nets include boracite and anatase. It is edge-transitive or isotoxal if it has one orbit of edges; crystals with edge-transitive crystal nets include boracite but not anatase – which has two orbits of edges. [7]

Geometry of crystal nets

In the geometry of crystal nets, one can treat edges as line segments. For example, in a crystal net, it is presumed that edges do not “collide” in the sense that when treating them as line segments, they do not intersect. Several polyhedral constructions can be derived from crystal nets. For example, a vertex figure can be obtained by subdividing each edge (treated as a line segment) by the insertion of subdividing points, and then the vertex figure of a given vertex is the convex hull of the adjacent subdividing points (i.e., the convex polyhedron whose vertices are the adjacent subdividing points).

Another polyhedral construction is to determine the neighborhood of a vertex in the crystal net. One application is to define an energy function as a (possibly weighted) sum of squares of distances from vertices to their neighbors, and with respect to this energy function, the net is in equilibrium (with respect to this energy function) if each vertex is positioned at the centroid of its neighborhood, [8] this is the basis of the crystal net identification program SYSTRE. [9] (mathematicians [10] use the term ``harmonic realiaztions" instead of ``crystal nets in equilibrium positions" because the positions are characterized by the discrete Laplace equation; they also introduced the notion of standard realizations which are special harmonic realizations characterized by a certain minimal principle as well;see [11] ). Some crystal nets are isomorphic to crystal nets in equilibrium positions, and since an equilibrium position is a normal form, the crystal net isomorphism problem (i.e., the query whether two given crystal nets are isomorphic as graphs; not to be confused with crystal isomorphism) is readily computed even though, as a subsumption of the graph isomorphism problem, it is apparently computationally difficult in general.

Active areas of crystal design using crystal nets

It is conjectured [12] that crystal nets may minimize entropy in the following sense. Suppose one is given an ensemble of uniformly discrete Euclidean graphs that fill space, with vertices representing atoms or molecular building blocks and with edges representing bonds or ligands, extending through all space to represent a solid. For some restrictions, there may be a unique Euclidean graph that minimizes a reasonably defined energy function, and the conjecture is that that Euclidean graph may necessarily be periodic. This question is still open, but some researchers observe crystal nets of high symmetry tending to predominate observed Euclidean graphs derived from some classes of materials. [13] [14]

Historically, crystals were developed by experimentation, currently formalized as combinatorial chemistry, but one contemporary desideratum is the synthesis of materials designed in advance, and one proposal is to design crystals (the designs being crystal nets, perhaps represented as one unit cell of a crystal net) and then synthesize them from the design. [15] This effort, in what Omar Yaghi described as reticular chemistry is proceeding on several fronts, from the theoretical [16] to synthesizing highly porous crystals. [17]

One of the primary issues in annealing crystals is controlling the constituents, which can be difficult if the constituents are individual atoms, e.g., in zeolites, which are typically porous crystals primarily of silicon and oxygen and occasional impurities. Synthesis of a specific zeolite de novo from a novel crystal net design remains one of the major goals of contemporary research. There are similar efforts in sulfides and phosphates.[ citation needed ]

Control is more tractable if the constituents are molecular building blocks, i.e., stable molecules that can be readily induced to assemble in accordance with geometric restrictions.[ citation needed ] Typically, while there may be many species of constituents, there are two main classes: somewhat compact and often polyhedral secondary building units (SBUs), and linking or bridging building units. A popular class of examples are the Metal-Organic Frameworks (MOFs), in which (classically) the secondary building units are metal ions or clusters of ions and the linking building units are organic ligands. These SBUs and ligands are relatively controllable, and some new crystals have been synthesized using designs of novel nets. [18] An organic variant are the Covalent Organic Frameworks (COFs), in which the SBUs might (but not necessarily) be themselves organic.[ citation needed ] The greater control over the SBUs and ligands can be seen in the fact that while no novel zeolites have been synthesized per design, several MOFs have been synthesized from crystal nets designed for zeolite synthesis, such as Zeolite-like Metal-Organic Frameworks (Z-MOFs)[ citation needed ] and zeolitic imidazolate framework (ZIFs).

See also

Related Research Articles

<span class="mw-page-title-main">Cube</span> Solid object with six equal square faces

In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets, or sides, with three meeting at each vertex. Viewed from a corner, it is a hexagon and its net is usually depicted as a cross.

<span class="mw-page-title-main">Dual polyhedron</span> Polyhedron associated with another by swapping vertices for faces

In geometry, every polyhedron is associated with a second dual structure, where the vertices of one correspond to the faces of the other, and the edges between pairs of vertices of one correspond to the edges between pairs of faces of the other. Such dual figures remain combinatorial or abstract polyhedra, but not all can also be constructed as geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron.

<span class="mw-page-title-main">Polyhedron</span> 3D shape with flat faces, straight edges and sharp corners

In geometry, a polyhedron is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices.

<span class="mw-page-title-main">4-polytope</span> Four-dimensional geometric object with flat sides

In geometry, a 4-polytope is a four-dimensional polytope. It is a connected and closed figure, composed of lower-dimensional polytopal elements: vertices, edges, faces (polygons), and cells (polyhedra). Each face is shared by exactly two cells. The 4-polytopes were discovered by the Swiss mathematician Ludwig Schläfli before 1853.

<span class="mw-page-title-main">Symmetry group</span> Group of transformations under which the object is invariant

In group theory, the symmetry group of a geometric object is the group of all transformations under which the object is invariant, endowed with the group operation of composition. Such a transformation is an invertible mapping of the ambient space which takes the object to itself, and which preserves all the relevant structure of the object. A frequent notation for the symmetry group of an object X is G = Sym(X).

<span class="mw-page-title-main">Truncated octahedron</span> Archimedean solid

In geometry, the truncated octahedron is the Archimedean solid that arises from a regular octahedron by removing six pyramids, one at each of the octahedron's vertices. The truncated octahedron has 14 faces, 36 edges, and 24 vertices. Since each of its faces has point symmetry the truncated octahedron is a 6-zonohedron. It is also the Goldberg polyhedron GIV(1,1), containing square and hexagonal faces. Like the cube, it can tessellate 3-dimensional space, as a permutohedron.

<span class="mw-page-title-main">Diamond cubic</span> Type of crystal structure

In crystallography, the diamond cubic crystal structure is a repeating pattern of 8 atoms that certain materials may adopt as they solidify. While the first known example was diamond, other elements in group 14 also adopt this structure, including α-tin, the semiconductors silicon and germanium, and silicon–germanium alloys in any proportion. There are also crystals, such as the high-temperature form of cristobalite, which have a similar structure, with one kind of atom at the positions of carbon atoms in diamond but with another kind of atom halfway between those.

<span class="mw-page-title-main">Geometric graph theory</span> Subfield of graph theory

Geometric graph theory in the broader sense is a large and amorphous subfield of graph theory, concerned with graphs defined by geometric means. In a stricter sense, geometric graph theory studies combinatorial and geometric properties of geometric graphs, meaning graphs drawn in the Euclidean plane with possibly intersecting straight-line edges, and topological graphs, where the edges are allowed to be arbitrary continuous curves connecting the vertices; thus, it can be described as "the theory of geometric and topological graphs". Geometric graphs are also known as spatial networks.

<span class="mw-page-title-main">Apeirogon</span> Polygon with an infinite number of sides

In geometry, an apeirogon or infinite polygon is a polygon with an infinite number of sides. Apeirogons are the rank 2 case of infinite polytopes. In some literature, the term "apeirogon" may refer only to the regular apeirogon, with an infinite dihedral group of symmetries.

<span class="mw-page-title-main">Omar M. Yaghi</span> Chemist

Omar M. Yaghi is the James and Neeltje Tretter Chair Professor of Chemistry at the University of California, Berkeley, an affiliate scientist at Lawrence Berkeley National Laboratory, the Founding Director of the Berkeley Global Science Institute, and an elected member of the US National Academy of Sciences as well as the German National Academy of Sciences Leopoldina.

In polyhedral combinatorics, a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and vertices of three-dimensional convex polyhedra: they are exactly the 3-vertex-connected planar graphs. That is, every convex polyhedron forms a 3-connected planar graph, and every 3-connected planar graph can be represented as the graph of a convex polyhedron. For this reason, the 3-connected planar graphs are also known as polyhedral graphs.

<span class="mw-page-title-main">Regular map (graph theory)</span> Symmetric tessellation of a closed surface

In mathematics, a regular map is a symmetric tessellation of a closed surface. More precisely, a regular map is a decomposition of a two-dimensional manifold into topological disks such that every flag can be transformed into any other flag by a symmetry of the decomposition. Regular maps are, in a sense, topological generalizations of Platonic solids. The theory of maps and their classification is related to the theory of Riemann surfaces, hyperbolic geometry, and Galois theory. Regular maps are classified according to either: the genus and orientability of the supporting surface, the underlying graph, or the automorphism group.

Covalent organic frameworks (COFs) are a class of porous polymers that form two- or three-dimensional structures through reactions between organic precursors resulting in strong, covalent bonds to afford porous, stable, and crystalline materials. COFs emerged as a field from the overarching domain of organic materials as researchers optimized both synthetic control and precursor selection. These improvements to coordination chemistry enabled non-porous and amorphous organic materials such as organic polymers to advance into the construction of porous, crystalline materials with rigid structures that granted exceptional material stability in a wide range of solvents and conditions. Through the development of reticular chemistry, precise synthetic control was achieved and resulted in ordered, nano-porous structures with highly preferential structural orientation and properties which could be synergistically enhanced and amplified. With judicious selection of COF secondary building units (SBUs), or precursors, the final structure could be predetermined, and modified with exceptional control enabling fine-tuning of emergent properties. This level of control facilitates the COF material to be designed, synthesized, and utilized in various applications, many times with metrics on scale or surpassing that of the current state-of-the-art approaches.

<span class="mw-page-title-main">Polyhedral graph</span> Graph made from vertices and edges of a convex polyhedron

In geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of a convex polyhedron. Alternatively, in purely graph-theoretic terms, the polyhedral graphs are the 3-vertex-connected, planar graphs.

<span class="mw-page-title-main">Hypothetical zeolite</span>

Hypothetical zeolites are combinatorial models of potential structures of the minerals known as zeolites. They are four-regular periodic graphs, with vertices representing the tetrahedral atom and the edges representing the bridging oxygen atoms. Alternatively, by ignoring the tetrahedral atoms, zeolites can be represented by a six-valent periodic graph of oxygen atoms, with each O-O edge defining an edge of a tetrahedron.

A Euclidean graph is periodic if there exists a basis of that Euclidean space whose corresponding translations induce symmetries of that graph. Equivalently, a periodic Euclidean graph is a periodic realization of an abelian covering graph over a finite graph. A Euclidean graph is uniformly discrete if there is a minimal distance between any two vertices. Periodic graphs are closely related to tessellations of space and the geometry of their symmetry groups, hence to geometric group theory, as well as to discrete geometry and the theory of polytopes, and similar areas.

<span class="mw-page-title-main">Laves graph</span> Periodic spatial graph

In geometry and crystallography, the Laves graph is an infinite and highly symmetric system of points and line segments in three-dimensional Euclidean space, forming a periodic graph. Three equal-length segments meet at 120° angles at each point, and all cycles use ten or more segments. It is the shortest possible triply periodic graph, relative to the volume of its fundamental domain. One arrangement of the Laves graph uses one out of every eight of the points in the integer lattice as its points, and connects all pairs of these points that are nearest neighbors, at distance . It can also be defined, divorced from its geometry, as an abstract undirected graph, a covering graph of the complete graph on four vertices.

Michael O’Keeffe is a British-American chemist. He is currently Regents’ Professor Emeritus in the School of Molecular Sciences at Arizona State University. As a scientist, he is particularly known for his contributions to the field of reticular chemistry. In 2019, he received the Gregori Aminoff Prize in Crystallography from the Royal Swedish Academy of Sciences.

<span class="mw-page-title-main">Hexastix</span> Geometric structure

Hexastix is a symmetric arrangement of non-intersecting prisms that, when extended infinitely, fill exactly 3/4 of space. The prisms in a hexastix arrangement are all parallel to 4 directions on the body-centered cubic lattice. In The Symmetries of Things, John Horton Conway, Heidi Burgiel, and Chaim Goodman-Strauss named this structure hexastix.

Alexander Frank Wells, or A. F. Wells, was a British chemist and crystallographer. He is known for his work on structural inorganic chemistry, which includes the description and classification of structural motifs, such as the polyhedral coordination environments, in crystals obtained from X-ray crystallography. His work is summarized in a classic reference book, Structural inorganic chemistry, first appeared in 1945 and has since gone through five editions. In addition, his work on crystal structures in terms of nets have been important and inspirational for the field of metal-organic frameworks and related materials.

References

  1. ↑ Sunada, T. (2012), "Lecture on topological crystallography", Japan. J. Math., 7: 1–39, doi:10.1007/s11537-012-1144-4
  2. ↑ Senechal, M. (1990), "A brief history of geometrical crystallography", in Lima-de-Faria, J. (ed.), Historical Atlas of Crystallography, Kluwer, pp. 43–59
  3. ↑ Wells, A. (1977). Three-dimensional Nets and Polyhedra. see Coxeter, H. S. M. (July 1978), "Review", Bulletin of the American Mathematical Society, 84 (3): 466–470, doi: 10.1090/S0002-9904-1978-14495-4
  4. ↑ Cohen, E.; Megiddo, N. (1991), "Recognizing Properties of Periodic Graphs" (PDF), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 4: Applied Geometry and Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 4: 135–146, CiteSeerX   10.1.1.124.9538 , doi:10.1090/dimacs/004/10, ISBN   9780821865934 , retrieved August 15, 2010
  5. ↑ Delgado-Friedrichs, O.; O’Keeffe, M. (2005), "Crystal nets as graphs: Terminology and definitions", Journal of Solid State Chemistry, 178 (8): 2480–2485, Bibcode:2005JSSCh.178.2480D, doi:10.1016/j.jssc.2005.06.011
  6. ↑ James, R.D. (2006), "Objective structures", Journal of the Mechanics and Physics of Solids, 54 (11): 2354–2390, Bibcode:2006JMPSo..54.2354J, doi:10.1016/j.jmps.2006.05.008
  7. ↑ "Reticular Chemical Structure Resource (RCSR)".
  8. ↑ Delgado-Friedrichs, O.; O’Keeffe, M. (2003), "Identification of and symmetry computation for crystal nets", Acta Crystallogr. A, 59 (4): 351–360, doi:10.1107/s0108767303012017, PMID   12832814
  9. ↑ Delgado-Friedrichs, O. "SYSTRE". The GAVROG Project.
  10. ↑ Kotani, M.; Sunada, T. (2000), "Standard realizations of crystal lattices via harmonic maps", Trans. Am. Math. Soc., 353: 1–20, doi: 10.1090/S0002-9947-00-02632-5
  11. ↑ Sunada, T. (2012), Topological crystallography ---With a View Towards Discrete Geometric Analysis---, Surveys and Tutorials in the Applied Mathematical Sciences, Vol. 6, Springer.
  12. ↑ Radin, C. (1999). Miles of Tiles. AMS. p. 60.
  13. ↑ O’Keeffe, M.; Eddaoudi, M.; Li, H.; Reineke, T.; Yaghi, O.M. (2000), "Frameworks for Extended Solids: Geometrical Design Principles", J. Solid State Chem., 152 (1): 3–20, Bibcode:2000JSSCh.152....3O, doi:10.1006/jssc.2000.8723
  14. ↑ Ockwig, N.W.; Delgado-Friedrichs, O.; O’Keeffe, M.; Yaghi, O.M. (2005), "Reticular Chemistry: Occurrence and Taxonomy of Nets and Grammar for the Design of Networks", Acc. Chem. Res., 38 (3): 176–182, CiteSeerX   10.1.1.590.6758 , doi:10.1021/ar020022l, PMID   15766236
  15. ↑ Yaghi, O. M.; O’Keeffe, M.; Ockwig, N. W.; Chae, H. K.; Eddaoudi, M.; Kim, J. (2003), "Reticular synthesis and the design of new materials" (PDF), Nature, 423 (12): 705–714, doi:10.1038/nature01650, hdl: 2027.42/62718 , PMID   12802325
  16. ↑ Férey, Gérard (June 2000), "Building Units Design and Scale Chemistry", Journal of Solid State Chemistry, 152 (1): 37–48, Bibcode:2000JSSCh.152...37F, doi:10.1006/jssc.2000.8667
  17. ↑ Eddaoudi, Mohamed; Moler, David B.; Li, Hailian; Chen, Banglin; Reineke, Theresa M.; O’Keeffe, Michael; Yaghi, Omar M. (2001), "Modular Chemistry: Secondary Building Units as a Basis for the Design of Highly Porous and Robust Metal-Organic Carboxylate Frameworks", Acc. Chem. Res., 34 (4): 319–330, doi:10.1021/ar000034b, PMID   11308306
  18. ↑ Nouar; Eubank; Bousquet; Wojtas; Zaworotko; Eddaoudi (2008), "Supermolecular Building Blocks (SBBs) for the Design and Synthesis of Highly Porous Metal-Organic Frameworks", Journal of the American Chemical Society, 130 (6): 1833–1835, doi:10.1021/ja710123s, PMID   18205363
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.