Lattices with exponentially large kissing numbers

S. Vladut
{"title":"Lattices with exponentially large kissing numbers","authors":"S. Vladut","doi":"10.2140/MOSCOW.2019.8.163","DOIUrl":null,"url":null,"abstract":"We construct a sequence of lattices $\\{L_{n_i}\\subset \\mathbb R^{n_i}\\}$ for $n_i\\longrightarrow\\infty$, with exponentially large kissing numbers, namely, $\\log_2\\tau(L_{n_i})> 0.0338\\cdot n_i -o(n_i)$. We also show that the maximum lattice kissing number $ \\tau^l_{n}$ in $n$ dimensions verifies $\\log_2\\tau^l_{n}> 0.0219\\cdot n -o(n)$.","PeriodicalId":36590,"journal":{"name":"Moscow Journal of Combinatorics and Number Theory","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2140/MOSCOW.2019.8.163","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow Journal of Combinatorics and Number Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2140/MOSCOW.2019.8.163","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 17

Abstract

We construct a sequence of lattices $\{L_{n_i}\subset \mathbb R^{n_i}\}$ for $n_i\longrightarrow\infty$, with exponentially large kissing numbers, namely, $\log_2\tau(L_{n_i})> 0.0338\cdot n_i -o(n_i)$. We also show that the maximum lattice kissing number $ \tau^l_{n}$ in $n$ dimensions verifies $\log_2\tau^l_{n}> 0.0219\cdot n -o(n)$.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有指数级大接吻数的晶格
我们为$n_i\longrightarrow\infty$构造了一个格序列$\{L_{n_i}\subset \mathbb R^{n_i}\}$,它具有指数级大的亲吻数,即$\log_2\tau(L_{n_i})> 0.0338\cdot n_i -o(n_i)$。我们还证明了$n$维的最大晶格亲和数$ \tau^l_{n}$验证了$\log_2\tau^l_{n}> 0.0219\cdot n -o(n)$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Moscow Journal of Combinatorics and Number Theory
Moscow Journal of Combinatorics and Number Theory Mathematics-Algebra and Number Theory
CiteScore
0.80
自引率
0.00%
发文量
21
期刊最新文献
Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs On families with bounded matching number Borsuk’s problem, Boltyanski’s illumination problem, and circumradius On a sum involving squarefull numbers, II Ramsey properties for integer sequences with restricted gaps
×
引用
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