An algorithm to find generators for the normalizer of an n-dimensional crystallographic point group in Gl(n,Z)

DOI10.1088/0305-4470/24/24/008zbMath0771.20017OpenAlexW2082701990MaRDI QIDQ3994298

Frank Wijnands

Publication date: 13 August 1992

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0305-4470/24/24/008

zbMATH Keywords

algorithmsdihedral groupnormalizersgroup extensionsquasicrystalspoint groupsgenerating setincommensurate crystalscoset decomposition\(n\)-dimensional space groups

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Statistical mechanics of crystals (82D25) Other geometric groups, including crystallographic groups (20H15) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (2)

A crystallographic approach to structural transitions in icosahedral viruses ⋮ Finite Outer Automorphism Groups of Crystallographic Groups

This page was built for publication: An algorithm to find generators for the normalizer of an n-dimensional crystallographic point group in Gl(n,Z)