Day Maxwell Christopher, Rostami Ali, Hawthorne Frank Christopher
Department of Earth Sciences, University of Manitoba, Winnipeg, Manitoba R3T 2N2, Canada.
Computer Science Department, Friedrich Schiller University Jena, Jena, 07743, Germany.
Acta Crystallogr A Found Adv. 2024 May 1;80(Pt 3):282-292. doi: 10.1107/S2053273324002523. Epub 2024 Apr 29.
Following the work of Day & Hawthorne [Acta Cryst. (2022), A78, 212-233] and Day et al. [Acta Cryst. (2024), A80, 258-281], the program GraphT-T has been developed to embed graphical representations of observed and hypothetical chains of (SiO) tetrahedra into 2D and 3D Euclidean space. During embedding, the distance between linked vertices (T-T distances) and the distance between unlinked vertices (T...T separations) in the resultant unit-distance graph are restrained to the average observed distance between linked Si tetrahedra (3.06±0.15 Å) and the minimum separation between unlinked vertices is restrained to be equal to or greater than the minimum distance between unlinked Si tetrahedra (3.713 Å) in silicate minerals. The notional interactions between vertices are described by a 3D spring-force algorithm in which the attractive forces between linked vertices behave according to Hooke's law and the repulsive forces between unlinked vertices behave according to Coulomb's law. Embedding parameters (i.e. spring coefficient, k, and Coulomb's constant, K) are iteratively refined during embedding to determine if it is possible to embed a given graph to produce a unit-distance graph with T-T distances and T...T separations that are compatible with the observed T-T distances and T...T separations in crystal structures. The resultant unit-distance graphs are denoted as compatible and may form crystal structures if and only if all distances between linked vertices (T-T distances) agree with the average observed distance between linked Si tetrahedra (3.06±0.15 Å) and the minimum separation between unlinked vertices is equal to or greater than the minimum distance between unlinked Si tetrahedra (3.713 Å) in silicate minerals. If the unit-distance graph does not satisfy these conditions, it is considered incompatible and the corresponding chain of tetrahedra is unlikely to form crystal structures. Using GraphT-T, Day et al. [Acta Cryst. (2024), A80, 258-281] have shown that several topological properties of chain graphs influence the flexibility (and rigidity) of the corresponding chains of Si tetrahedra and may explain why particular compatible chain arrangements (and the minerals in which they occur) are more common than others and/or why incompatible chain arrangements do not occur in crystals despite being topologically possible.
在Day和Hawthorne [《晶体学报》(2022年),A78,212 - 233]以及Day等人[《晶体学报》(2024年),A80,258 - 281]的工作基础上,开发了程序GraphT - T,用于将观察到的和假设的(SiO)四面体链的图形表示嵌入到二维和三维欧几里得空间中。在嵌入过程中,所得单位距离图中相连顶点之间的距离(T - T距离)和不相连顶点之间的距离(T...T间距)被限制为相连硅四面体之间观察到的平均距离(3.06±0.15 Å),并且不相连顶点之间的最小间距被限制为等于或大于硅酸盐矿物中不相连硅四面体之间的最小距离(3.713 Å)。顶点之间的概念性相互作用由一种三维弹簧力算法描述,其中相连顶点之间的吸引力根据胡克定律起作用,不相连顶点之间的排斥力根据库仑定律起作用。在嵌入过程中迭代优化嵌入参数(即弹簧系数k和库仑常数K),以确定是否有可能嵌入给定的图,从而生成一个单位距离图,其T - T距离和T...T间距与晶体结构中观察到的T - T距离和T...T间距兼容。所得的单位距离图被称为兼容图,并且当且仅当相连顶点之间的所有距离(T - T距离)与相连硅四面体之间观察到的平均距离(3.06±0.15 Å)一致,且不相连顶点之间的最小间距等于或大于硅酸盐矿物中不相连硅四面体之间的最小距离(3.713 Å)时,才可能形成晶体结构。如果单位距离图不满足这些条件,则被认为是不兼容的,并且相应的四面体链不太可能形成晶体结构。Day等人[《晶体学报》(2024年),A80,258 - 281]使用GraphT - T表明,链图的几个拓扑性质会影响相应硅四面体链的柔韧性(和刚性),并且可以解释为什么特定的兼容链排列(以及它们出现的矿物)比其他排列更常见,和/或为什么不兼容的链排列尽管在拓扑上是可能的,但在晶体中却不会出现。