Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: International Conference on Advances in Material Science and Technology, CAMSTech 2020
Год издания: 2020
Идентификатор DOI: 10.1088/1757-899X/919/5/052047
Аннотация: Computational group theory investigates the arithmetic properties of algebraic structures. These properties may be utilized in development of algorithms for data analysis and machine learning. This direction is associated with the design, analysis of algorithms and data structures for calculating various characteristics for (mostlyПоказать полностьюfinite) groups. The area is interesting for investigation of important from various points of view groups that are important, the data about which cannot be obtained by manually. The present work was carried out in line with computer calculations in groups. Based on the concept of the group growth function, the concept of the group density function is introduced. The growth and density functions of finite simple non-Abelian groups of small orders are constructed. The question of recognizability of finite simple non-Abelian groups by the density function is considered. The problem of effective storage of finite group elements in computer memory using the AVL tree is investigated. Based on the AVL tree, a fast algorithm for enumerating all elements of a finite group is developed. With the computer calculations, the recognizability of two finite simple non-Abelian groups by the group density function is proved. © Published under licence by IOP Publishing Ltd.
Журнал: IOP Conference Series: Materials Science and Engineering
Выпуск журнала: Vol. 919, Is. 5
Номера страниц: 52047
ISSN журнала: 17578981
Издатель: IOP Publishing Ltd