Algorithms for crystallographic groups
From MaRDI portal
Cites work
- Bieberbach groups and flat manifolds
- Counting Crystallographic Groups in Low Dimensions
- Dual Cones and the Voronoi Algorithm
- scientific article; zbMATH DE number 3592224 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- Three finiteness theorems for \(G\)-forms
Cited in
(9)- Algorithms for symmetric groups of simplexes
- An algebraic method for calculating crystallographic groups. I
- An algebraic method for calculating crystallographic groups. II
- Interactive 3D Space Group Visualization with CLUCalc and Crystallographic Subperiodic Groups in Geometric Algebra
- scientific article; zbMATH DE number 194159 (Why is no real title available?)
- Algorithmic Recognition of Group Actions on Orbitals
- On the algebraic classification of subgroups of hyperbolic planar crystallographic groups
- An algorithm for the arithmetic classification of multilattices
- Representations of the symmetry groups of infinite crystals
This page was built for publication: Algorithms for crystallographic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3566859)