Informational complexity of the generating subset of crystallographic groups

database, nuove specie, discrediti,
ridefinizioni, classificazioni, ecc.
Rispondi
Avatar utente
Marco E. Ciriotti
Messaggi: 31675
Iscritto il: ven 25 giu, 2004 11:31
Località: via San Pietro, 55 I-10073 Devesi/Cirié TO - Italy
Contatta:

Informational complexity of the generating subset of crystallographic groups

Messaggio da Marco E. Ciriotti » gio 28 lug, 2022 15:59

Referenza:
▪ Banaru, A.M., Banaru, D.A., Aksenov, S.M. (2022): Informational Complexity of the Generating Subset of Crystallographic Groups. Crystallography Reports, 67, 521-529.

Abstract:
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.

NdR: Un'analoga ricerca personale colloca nella (super)famiglia strutturale del rame (copper) 1533 specie minerali.
Marco E. Ciriotti

«Things are interesting only in so far as they relate themselves to other things»

Rispondi

Chi c’è in linea

Visitano il forum: Nessuno e 43 ospiti