Systematic generation of all nonequivalent closest-packed stacking sequences of length N using group theory
2001 ◽
Vol 57
(6)
◽
pp. 766-771
◽
Keyword(s):
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 ≃ D N × 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.
2017 ◽
Vol 351
◽
pp. 230-253
◽
Keyword(s):
2010 ◽
Vol 37-38
◽
pp. 362-365
2004 ◽
Vol 7
◽
pp. 101-119
◽
2009 ◽
Vol 20
(11)
◽
pp. 1681-1696
A new method to analyse mosaics based on Symmetry Group theory applied to Islamic Geometric Patterns
2015 ◽
Vol 130
◽
pp. 54-70
◽