Informational Complexity of the Generating Subset of Crystallographic Groups

被引：1
|
作者：
Banaru, A. M. [1 ,2 ]
Banaru, D. A. [3 ]
Aksenov, S. M. [2 ]
机构：
[1] Moscow MV Lomonosov State Univ, Moscow 119991, Russia
[2] Russian Acad Sci, Kola Sci Ctr, Apatity 184209, Russia
[3] Russian Acad Sci, Vernadsky Inst Geochem & Analyt Chem, Moscow 119334, Russia
来源：
CRYSTALLOGRAPHY REPORTS | 2022年 / 67卷 / 04期
基金：
俄罗斯科学基金会;
关键词：
STRUCTURAL COMPLEXITY; COORDINATION NUMBERS; CRYSTAL-STRUCTURES; CRITICAL TOPOLOGY; SYMMETRY; ENTROPY; SET; MAPPINGS; NETS;
D O I：
10.1134/S106377452203004X
中图分类号：
O7 [晶体学];
学科分类号：
0702 ; 070205 ; 0703 ; 080501 ;
摘要：
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.
引用
收藏
页码：521 / 529
页数：9
相关论文
共 50 条
  • [1] Informational Complexity of the Generating Subset of Crystallographic Groups
    A. M. Banaru
    D. A. Banaru
    S. M. Aksenov
    [J]. Crystallography Reports, 2022, 67 : 521 - 529
  • [2] Minimal Generating Subsets of Crystallographic Point Groups
    A. M. Banaru
    [J]. Crystallography Reports, 2018, 63 : 1077 - 1081
  • [3] Minimal Generating Subsets of Crystallographic Point Groups
    Banaru, A. M.
    [J]. CRYSTALLOGRAPHY REPORTS, 2018, 63 (07) : 1077 - 1081
  • [4] The Energy of Cayley Graphs for a Generating Subset of the Dihedral Groups
    Fadzil, Amira Fadina Ahmad
    Sarmin, Nor Haniza
    Erfanian, Ahmad
    [J]. MATEMATIKA, 2019, 35 (03) : 371 - 376
  • [5] ISOSUBGROUP: an internet tool for generating isotropy subgroups of crystallographic space groups
    Stokes, Harold T.
    van Orden, Seth
    Campbell, Branton J.
    [J]. JOURNAL OF APPLIED CRYSTALLOGRAPHY, 2016, 49 : 1849 - 1853
  • [6] THE TIME COMPLEXITY OF SOME ALGORITHMS FOR GENERATING THE SPECTRA OF FINITE SIMPLE GROUPS
    Buturlakin, A. A.
    [J]. SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2022, 19 (01): : 101 - 108
  • [7] THE INFORMATIONAL BASIS OF JUDGED COMPLEXITY
    HOUSTON, JP
    GARSKOF, BE
    SILBER, DE
    [J]. JOURNAL OF GENERAL PSYCHOLOGY, 1965, 72 (02): : 277 - 284
  • [8] COMMUTATOR GROUPS OF CRYSTALLOGRAPHIC GROUPS
    SIVARDIERE, J
    [J]. ACTA CRYSTALLOGRAPHICA SECTION A, 1982, 38 (JAN): : 71 - 74
  • [9] INFORMATIONAL COMPLEXITY OF MATHEMATICAL-PROGRAMMING
    NEMIROVSKIY, AS
    YUDIN, DB
    [J]. ENGINEERING CYBERNETICS, 1983, 21 (01): : 76 - 100
  • [10] Perspectives from the informational complexity of learning
    Niyogi, P
    [J]. ISCAS 2000: IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - PROCEEDINGS, VOL III: EMERGING TECHNOLOGIES FOR THE 21ST CENTURY, 2000, : 259 - 262
12345