Brillouin Zones of Integer Lattices and Their Perturbations

IF 0.9 3区 数学 Q2 MATHEMATICS SIAM Journal on Discrete Mathematics Pub Date : 2024-06-07 DOI:10.1137/22m1489071
Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, Mathijs Wintraecken
{"title":"Brillouin Zones of Integer Lattices and Their Perturbations","authors":"Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, Mathijs Wintraecken","doi":"10.1137/22m1489071","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1784-1807, June 2024. <br/> Abstract. For a locally finite set, [math], the [math]th Brillouin zone of [math] is the region of points [math] for which [math] is the [math]th smallest among the Euclidean distances between [math] and the points in [math]. If [math] is a lattice, the [math]th Brillouin zones of the points in [math] are translates of each other, and together they tile space. Depending on the value of [math], they express medium- or long-range order in the set. We study fundamental geometric and combinatorial properties of Brillouin zones, focusing on the integer lattice and its perturbations. Our results include the stability of a Brillouin zone under perturbations, a linear upper bound on the number of chambers in a zone for lattices in [math], and the convergence of the maximum volume of a chamber to zero for the integer lattice.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/22m1489071","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1784-1807, June 2024.
Abstract. For a locally finite set, [math], the [math]th Brillouin zone of [math] is the region of points [math] for which [math] is the [math]th smallest among the Euclidean distances between [math] and the points in [math]. If [math] is a lattice, the [math]th Brillouin zones of the points in [math] are translates of each other, and together they tile space. Depending on the value of [math], they express medium- or long-range order in the set. We study fundamental geometric and combinatorial properties of Brillouin zones, focusing on the integer lattice and its perturbations. Our results include the stability of a Brillouin zone under perturbations, a linear upper bound on the number of chambers in a zone for lattices in [math], and the convergence of the maximum volume of a chamber to zero for the integer lattice.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
整数网格的布里渊区及其扰动
SIAM 离散数学杂志》,第 38 卷,第 2 期,第 1784-1807 页,2024 年 6 月。 摘要。对于局部有限集[math],[math]的[math]th 布里渊区是[math]与[math]中各点的欧氏距离中[math]th 最小的点[math]区域。如果[math]是一个晶格,那么[math]中各点的[math]th布里渊区就是彼此的平移,它们一起平铺空间。根据[math]值的不同,它们表达了集合中的中程或远程秩序。我们研究了布里渊区的基本几何和组合性质,重点是整数网格及其扰动。我们的研究结果包括布里渊区在扰动下的稳定性、[math]中点阵的布里渊区腔室数量的线性上限,以及整数点阵的腔室最大体积趋近于零。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.90
自引率
0.00%
发文量
124
审稿时长
4-8 weeks
期刊介绍: SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution. Topics include but are not limited to: properties of and extremal problems for discrete structures combinatorial optimization, including approximation algorithms algebraic and enumerative combinatorics coding and information theory additive, analytic combinatorics and number theory combinatorial matrix theory and spectral graph theory design and analysis of algorithms for discrete structures discrete problems in computational complexity discrete and computational geometry discrete methods in computational biology, and bioinformatics probabilistic methods and randomized algorithms.
期刊最新文献
An Algorithm to Recover Shredded Random Matrices On Powers of Hamilton Cycles in Ramsey–Turán Theory Maximum Number of Symmetric Extensions in Random Graphs Graphs of Degree at Least [math] with Minimum Algebraic Connectivity On the Turán Number of Edge Blow-Ups of Cliques
×
引用
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