Close-packed structures with finite-range interaction: computational mechanics of layer pair interaction.

Acta Crystallogr A Found Adv

Universidade Federal de Uberlandia, Avenida Joao Naves de Avila, 2121- Campus Santa Monica, CEP 38408-144, Minas Gerais, Brazil.

Published: July 2017

The stacking problem is approached by computational mechanics, using an Ising next-nearest-neighbour model. Computational mechanics allows one to treat the stacking arrangement as an information processing system in the light of a symbol-generating process. A general method for solving the stochastic matrix of the random Gibbs field is presented and then applied to the problem at hand. The corresponding phase diagram is then discussed in terms of the underlying ℇ-machine, or optimal finite-state machine. The occurrence of higher-order polytypes at the borders of the phase diagram is also analysed. The applicability of the model to real systems such as ZnS and cobalt is discussed. The method derived is directly generalizable to any one-dimensional model with finite-range interaction.

Download full-text PDF

Source
http://dx.doi.org/10.1107/S2053273317006945DOI Listing

Publication Analysis

Top Keywords

computational mechanics
12
finite-range interaction
8
phase diagram
8
close-packed structures
4
structures finite-range
4
interaction computational
4
mechanics layer
4
layer pair
4
pair interaction
4
interaction stacking
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!