ISSN:
1600-5740
Source:
Crystallography Journals Online : IUCR Backfile Archive 1948-2001
Topics:
Chemistry and Pharmacology
,
Geosciences
,
Physics
Notes:
An algorithm has been developed that generates all of the nonequivalent closest-packed stacking sequences of length N. There are 2N + 2(−1)N different labels for closest-packed stacking sequences of length N using the standard A, B, C notation. These labels are generated using an ordered binary tree. As different labels can describe identical structures, we have derived a generalized symmetry group, Q ∼ DN × S3, to sort these into crystallographic equivalence classes. This problem is shown to be a constrained version of the classic three-colored necklace problem.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1107/S010876810101552X