Algorithmic Symplectic Packing

IF 0.7 4区 数学 Q2 MATHEMATICS
Greta Fischer, J. Gutt, M. Junger
{"title":"Algorithmic Symplectic Packing","authors":"Greta Fischer, J. Gutt, M. Junger","doi":"10.1080/10586458.2022.2041135","DOIUrl":null,"url":null,"abstract":"In this article we explore a symplectic packing problem where the targets and domains are 2n-dimensional symplectic manifolds. We work in the context where the manifolds have first homology group equal to Z, and we require the embeddings to induce isomorphisms between first homology groups. In this case, Maley, Mastrangeli and Traynor [MMT00] showed that the problem can be reduced to a combinatorial optimization problem, namely packing certain allowable simplices into a given standard simplex. They designed a computer program and presented computational results. In particular, they determined the simplex packing widths in dimension four for up to k = 12 simplices, along with lower bounds for higher values of k. We present a modified algorithmic approach that allows us to determine the k-simplex packing widths for up to k = 13 simplices in dimension four and up to k = 8 simplices in dimension six. Moreover, our approach determines all simplex-multisets that allow for optimal packings.","PeriodicalId":50464,"journal":{"name":"Experimental Mathematics","volume":" ","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2021-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Experimental Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/10586458.2022.2041135","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

In this article we explore a symplectic packing problem where the targets and domains are 2n-dimensional symplectic manifolds. We work in the context where the manifolds have first homology group equal to Z, and we require the embeddings to induce isomorphisms between first homology groups. In this case, Maley, Mastrangeli and Traynor [MMT00] showed that the problem can be reduced to a combinatorial optimization problem, namely packing certain allowable simplices into a given standard simplex. They designed a computer program and presented computational results. In particular, they determined the simplex packing widths in dimension four for up to k = 12 simplices, along with lower bounds for higher values of k. We present a modified algorithmic approach that allows us to determine the k-simplex packing widths for up to k = 13 simplices in dimension four and up to k = 8 simplices in dimension six. Moreover, our approach determines all simplex-multisets that allow for optimal packings.
算法辛包装
本文研究了目标和域为2n维辛流形的辛堆积问题。我们在流形具有等于Z的第一同调群的情况下工作,并且我们需要嵌入来诱导第一同调组之间的同构。在这种情况下,Maley、Mastrangeli和Traynor[MMT00]表明,该问题可以归结为组合优化问题,即将某些允许的单纯形封装到给定的标准单纯形中。他们设计了一个计算机程序并给出了计算结果。特别地,他们确定了高达k=12的单形在维度4中的单纯形填充宽度,以及k的较高值的下界。我们提出了一种改进的算法方法,允许我们确定高达k=13的维度4和高达k=8的维度6的单形的k-单纯形填充宽度。此外,我们的方法确定了所有允许最优包装的单纯形多集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Experimental Mathematics
Experimental Mathematics 数学-数学
CiteScore
1.70
自引率
0.00%
发文量
23
审稿时长
>12 weeks
期刊介绍: Experimental Mathematics publishes original papers featuring formal results inspired by experimentation, conjectures suggested by experiments, and data supporting significant hypotheses. Experiment has always been, and increasingly is, an important method of mathematical discovery. (Gauss declared that his way of arriving at mathematical truths was "through systematic experimentation.") Yet this tends to be concealed by the tradition of presenting only elegant, fully developed, and rigorous results. Experimental Mathematics was founded in the belief that theory and experiment feed on each other, and that the mathematical community stands to benefit from a more complete exposure to the experimental process. The early sharing of insights increases the possibility that they will lead to theorems: An interesting conjecture is often formulated by a researcher who lacks the techniques to formalize a proof, while those who have the techniques at their fingertips have been looking elsewhere. Even when the person who had the initial insight goes on to find a proof, a discussion of the heuristic process can be of help, or at least of interest, to other researchers. There is value not only in the discovery itself, but also in the road that leads to it.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信