Determining isomorphic crystal structures

DOI10.1007/978-3-032-15641-9_19MaRDI QIDQ7348939zbMATH OpenFDO

Authors Nataşa Jonoska, Milé Krajčevski, Gregory Loren McColm

Publication date 15 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-15641-9_19

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• A contribution to the theory of voltage graphs
• Complexity of the Havas, Majewski, Matthews LLL Hermite normal form algorithm
• Counter machines and crystallographic structures
• Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation
• Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
• Frameworks with crystallographic symmetry
• Graph isomorphism problem
• Graph theory with applications
• Handbook of graph theory
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Identification of and symmetry computation for crystal nets
• Integer multiplication in time \(O(n\log n)\)
• Isomorphism Classes of Graph Bundles
• Nomenclature and generation of three-periodic nets: the vector method
• Realizations of crystal nets. I: (Generalized) derived graphs
• Three-dimensional Euclidean nets from two-dimensional hyperbolic tilings: kaleidoscopic examples
• Topological crystallography. With a view towards discrete geometric analysis

This page was built for publication: Determining isomorphic crystal structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348939)