An algorithm for the arithmetic classification of multilattices.

IF 1.8 4区 材料科学 Acta Crystallographica Section A Pub Date : 2013-01-01 Epub Date: 2012-11-14 DOI:10.1107/S010876731203629X
Giuliana Indelicato
{"title":"An algorithm for the arithmetic classification of multilattices.","authors":"Giuliana Indelicato","doi":"10.1107/S010876731203629X","DOIUrl":null,"url":null,"abstract":"<p><p>A procedure for the construction and the classification of monoatomic multilattices in arbitrary dimension is developed. The algorithm allows one to determine the location of the points of all monoatomic multilattices with a given symmetry, or to determine whether two assigned multilattices are arithmetically equivalent. This approach is based on ideas from integral matrix theory, in particular the reduction to the Smith normal form, and can be coded to provide a classification software package.</p>","PeriodicalId":7400,"journal":{"name":"Acta Crystallographica Section A","volume":"69 Pt 1","pages":"63-74"},"PeriodicalIF":1.8000,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1107/S010876731203629X","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Crystallographica Section A","FirstCategoryId":"88","ListUrlMain":"https://doi.org/10.1107/S010876731203629X","RegionNum":4,"RegionCategory":"材料科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2012/11/14 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

A procedure for the construction and the classification of monoatomic multilattices in arbitrary dimension is developed. The algorithm allows one to determine the location of the points of all monoatomic multilattices with a given symmetry, or to determine whether two assigned multilattices are arithmetically equivalent. This approach is based on ideas from integral matrix theory, in particular the reduction to the Smith normal form, and can be coded to provide a classification software package.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多维格的一种算法分类。
给出了任意维单原子多晶格的构造和分类方法。该算法允许人们确定具有给定对称性的所有单原子多格点的位置,或者确定两个指定的多格是否在算术上相等。这种方法基于积分矩阵理论的思想,特别是对史密斯范式的简化,并且可以编码为提供分类软件包。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
11.10%
发文量
0
审稿时长
3 months
期刊介绍: Acta Crystallographica Section A: Foundations and Advances publishes articles reporting advances in the theory and practice of all areas of crystallography in the broadest sense. As well as traditional crystallography, this includes nanocrystals, metacrystals, amorphous materials, quasicrystals, synchrotron and XFEL studies, coherent scattering, diffraction imaging, time-resolved studies and the structure of strain and defects in materials. The journal has two parts, a rapid-publication Advances section and the traditional Foundations section. Articles for the Advances section are of particularly high value and impact. They receive expedited treatment and may be highlighted by an accompanying scientific commentary article and a press release. Further details are given in the November 2013 Editorial. The central themes of the journal are, on the one hand, experimental and theoretical studies of the properties and arrangements of atoms, ions and molecules in condensed matter, periodic, quasiperiodic or amorphous, ideal or real, and, on the other, the theoretical and experimental aspects of the various methods to determine these properties and arrangements.
期刊最新文献
A new vision for Acta Crystallographica Section A. Nets with collisions (unstable nets) and crystal chemistry. Homometry in the light of coherent beams. More about residual values. Direct phasing of nanocrystal diffraction.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1