A fast algorithm to find reduced hyperplane unit cells and solve N-dimensional Bézout's identities

DOI10.1107/S2053273321006835MaRDI QIDQ6565495zbMATH OpenFDO

Authors Cyril Cayron

Publication date 2 July 2024

Published in Acta Crystallographica. Section A (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

twinninginteger relation\(N\)-dimensional Bézout's identityhyperplane unit cell

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Computational methods for problems pertaining to convex and discrete geometry (52-08)

Recommendations

• On Matrix Equations of Twinning in Crystals
• Unusual Solutions of Twinning Equations in the X-ray Theory
• Finite deformation by mechanical twinning
• On the kinematics of mechanical twinning in crystals
• Algorithms for target transformations of lattice basis vectors

This page was built for publication: A fast algorithm to find reduced hyperplane unit cells and solve \(N\)-dimensional Bézout's identities

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