六维球体包装和线性规划

IF 2.2 2区数学 Q1 MATHEMATICS, APPLIED

Mathematics of Computation Pub Date : 2024-03-20 DOI:10.1090/mcom/3959

Matthew de Courcy-Ireland, Maria Dostert, Maryna Viazovska

{"title":"六维球体包装和线性规划","authors":"Matthew de Courcy-Ireland, Maria Dostert, Maryna Viazovska","doi":"10.1090/mcom/3959","DOIUrl":null,"url":null,"abstract":"<p>We prove that the Cohn–Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn–Triantafillou [Math. Comp. 91 (2021), pp. 491–508] to the case of odd weight and non-trivial character.</p>","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":"133 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Six-dimensional sphere packing and linear programming\",\"authors\":\"Matthew de Courcy-Ireland, Maria Dostert, Maryna Viazovska\",\"doi\":\"10.1090/mcom/3959\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We prove that the Cohn–Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn–Triantafillou [Math. Comp. 91 (2021), pp. 491–508] to the case of odd weight and non-trivial character.</p>\",\"PeriodicalId\":18456,\"journal\":{\"name\":\"Mathematics of Computation\",\"volume\":\"133 1\",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematics of Computation\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1090/mcom/3959\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics of Computation","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1090/mcom/3959","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

我们证明了 Cohn-Elkies 线性编程约束在维度 6 中并不尖锐。证明使用了模块形式空间上的对偶性和优化，将 Cohn-Triantafillou [Math. Comp. 91 (2021), pp.

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Six-dimensional sphere packing and linear programming

We prove that the Cohn–Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn–Triantafillou [Math. Comp. 91 (2021), pp. 491–508] to the case of odd weight and non-trivial character.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Mathematics of Computation 数学-应用数学

CiteScore

3.90

自引率

5.00%

发文量

审稿时长

7.0 months

期刊介绍： All articles submitted to this journal are peer-reviewed. The AMS has a single blind peer-review process in which the reviewers know who the authors of the manuscript are, but the authors do not have access to the information on who the peer reviewers are. This journal is devoted to research articles of the highest quality in computational mathematics. Areas covered include numerical analysis, computational discrete mathematics, including number theory, algebra and combinatorics, and related fields such as stochastic numerical methods. Articles must be of significant computational interest and contain original and substantial mathematical analysis or development of computational methodology.