On the combinatorics of crystal structures. II. Number of Wyckoff sequences of a given subdivision complexity

Hornfeck, W.; Červený, K.

doi:10.1107/S2053273323002437

Acta Crystallographica Section A
Acta Crystallographica
Section A FOUNDATIONS AND ADVANCES

IUCr IT WDC

home archive editors for authors for readers submit subscribe open access

view article

Figure 7
Dynamic programming approach (Python). Here, the target tuple is given as [M,A] = [12,3] and the Wyckoff tuples are given as $[{\cal W} = [[2,0],[2,0],[2,1],[4,1],[4,2],[8,3]]]$ .

FOUNDATIONS
ADVANCES

ISSN: 2053-2733

Volume 79| Part 3| May 2023| Pages 280-294

https://doi.org/10.1107/S2053273323002437

Open

access

Follow Acta Cryst. A

Search IUCr Journals		doi		Advanced search
Author		volume	page