Mathematics of 2-Dimensional Lattices

9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was partially resolved, but standard reductions remain discontinuous under perturbations modelling atomic displacements. This paper completes a continuous classification of 2-dimensional lattices up to Euclidean isometry (or congruence), rigid motion (without reflections), and similarity (with uniform scaling). The new homogeneous invariants allow easily computable metrics on lattices considered up to the equivalences above. The metrics up to rigid motion are especially non-trivial and settle all remaining questions on (dis)continuity of lattice bases. These metrics lead to real-valued chiral distances that continuously measure lattice deviations from higher-symmetry neighbours. The geometric methods extend the past work of Delone, Conway, and Sloane.

Cite

CITATION STYLE

APA

Kurlin, V. (2024). Mathematics of 2-Dimensional Lattices. Foundations of Computational Mathematics, 24(3), 805–863. https://doi.org/10.1007/s10208-022-09601-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free