Fischer, Greta, Gutt, Jean and Junger, Michael . Algorithmic Symplectic Packing. Exp. Math.. PHILADELPHIA: TAYLOR & FRANCIS INC. ISSN 1944-950X

Full text not available from this repository.

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(n) , and we require the embeddings to induce isomorphisms between first homology groups. In this case, Miller Maley, Mastrangeli, and Traynor 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.

Item Type: Journal Article
Creators:
CreatorsEmailORCIDORCID Put Code
Fischer, GretaUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Gutt, JeanUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Junger, MichaelUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
URN: urn:nbn:de:hbz:38-670991
DOI: 10.1080/10586458.2022.2041135
Journal or Publication Title: Exp. Math.
Publisher: TAYLOR & FRANCIS INC
Place of Publication: PHILADELPHIA
ISSN: 1944-950X
Language: English
Faculty: Unspecified
Divisions: Unspecified
Subjects: no entry
Uncontrolled Keywords:
KeywordsLanguage
MathematicsMultiple languages
URI: http://kups.ub.uni-koeln.de/id/eprint/67099

Downloads

Downloads per month over past year

Altmetric

Export

Actions (login required)

View Item View Item