Informational Complexity of the Generating Subset of Crystallographic Groups

By analogy with the Shannon’s complexity of graphs, the complexity of minimal generating subsets of finitely generated discrete groups, including crystallographic ones, was introduced. The introduced value can be useful in the analysis of molecular structures and other ones with fuzzy bearing contacts. An algorithm was developed, and the calculation results are presented for some finite groups, including crystal classes.