Crystallographic Algorithms and Tables

1998/09/01 by Jürgen Opgenorth, Wilhelm Plesken, T. Schulz · 61 citations
Mathematics · Computer Science · Chemistry · #Geometric and Algebraic Topology #semigroups and automata theory #Topological and Geometric Data Analysis #Dimension (graph theory) #Space (punctuation) #Bravais lattice #Basis (linear algebra) #Computer science #Algorithm #Mathematics #Theoretical computer science #Combinatorics #Crystallography #Geometry #Crystal structure #Chemistry

paper · doi:10.1107/s010876739701547x

published in Acta Crystallographica Section A Foundations of Crystallography 54(5), 517-531 (Wiley)

openalex publication_date 1998/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/02

Abstract

A survey of definitions, theorems and algorithms for crystallographic groups are given in a dimension-independent fashion. These and some tables (including the Bravais groups up to dimension 6) form the basis of the computer package CARAT, which can handle crystallographic space groups up to dimension 6.

Citations

• Linear Representations of Finite Groups

Cited by

• Report of a Subcommittee on the Nomenclature ofn-Dimensional Crystallography. II. Symbols for arithmetic crystal classes, Bravais classes and space groupsSubcommittee renewed by the IUCr Commission on Crystallographic Nomenclature 18 March 1999 with all present co-authors as members. Original version of the Report received by the Commission 22 April 2002, accepted 19 July 2002.
• Heterotic non-abelian orbifolds
• Space group [wikipedia]