Abstract
An algorithm has been developed that generates all of the nonequivalent closest-packed stacking sequences of length N. There are 2(N) + 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 approximately equal to D(N) x S(3), to sort these into crystallographic equivalence classes. This problem is shown to be a constrained version of the classic three-colored necklace problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Acta Crystallographica Section B Structural Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
