Recognition of near-duplicate periodic patterns by continuous metrics with approximation guarantees
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908617495543808 |
|---|---|
| author | Anosova, Olga Widdowson, Daniel Kurlin, Vitaliy |
| author_facet | Anosova, Olga Widdowson, Daniel Kurlin, Vitaliy |
| contents | This paper rigorously solves the challenging problem of recognizing periodic patterns under rigid motion in Euclidean geometry. The 3-dimensional case is practically important for justifying the novelty of solid crystalline materials (periodic crystals) and for patenting medical drugs in a solid tablet form. Past descriptors based on finite subsets fail when a unit cell of a periodic pattern discontinuously changes under almost any perturbation of atoms, which is inevitable due to noise and atomic vibrations. The major problem is not only to find complete invariants (descriptors with no false negatives and no false positives for all periodic patterns) but to design efficient algorithms for distance metrics on these invariants that should continuously behave under noise. The proposed continuous metrics solve this problem in any Euclidean dimension and are algorithmically approximated with small error factors in times that are explicitly bounded in the size and complexity of a given pattern. The proved Lipschitz continuity allows us to confirm all near-duplicates filtered by simpler invariants in major databases of experimental and simulated crystals. This practical detection of noisy duplicates will stop the artificial generation of `new' materials from slight perturbations of known crystals. Several such duplicates are under investigation by five journals for data integrity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2205_15298 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Recognition of near-duplicate periodic patterns by continuous metrics with approximation guarantees Anosova, Olga Widdowson, Daniel Kurlin, Vitaliy Metric Geometry 52C07, 51N20, 51K05, 52C25 This paper rigorously solves the challenging problem of recognizing periodic patterns under rigid motion in Euclidean geometry. The 3-dimensional case is practically important for justifying the novelty of solid crystalline materials (periodic crystals) and for patenting medical drugs in a solid tablet form. Past descriptors based on finite subsets fail when a unit cell of a periodic pattern discontinuously changes under almost any perturbation of atoms, which is inevitable due to noise and atomic vibrations. The major problem is not only to find complete invariants (descriptors with no false negatives and no false positives for all periodic patterns) but to design efficient algorithms for distance metrics on these invariants that should continuously behave under noise. The proposed continuous metrics solve this problem in any Euclidean dimension and are algorithmically approximated with small error factors in times that are explicitly bounded in the size and complexity of a given pattern. The proved Lipschitz continuity allows us to confirm all near-duplicates filtered by simpler invariants in major databases of experimental and simulated crystals. This practical detection of noisy duplicates will stop the artificial generation of `new' materials from slight perturbations of known crystals. Several such duplicates are under investigation by five journals for data integrity. |
| title | Recognition of near-duplicate periodic patterns by continuous metrics with approximation guarantees |
| topic | Metric Geometry 52C07, 51N20, 51K05, 52C25 |
| url | https://arxiv.org/abs/2205.15298 |