Toric symplectic ball packing
classification
🧮 math.SG
math.CO
keywords
symplecticpackingproblemballtoricsolveadmitapplications
read the original abstract
We define and solve the toric version of the symplectic ball packing problem, in the sense of listing all 2n-dimensional symplectic-toric manifolds which admit a perfect packing by balls embedded in a symplectic and torus equivariant fashion. In order to do this we first describe a problem in geometric-combinatorics which is equivalent to the toric symplectic ball packing problem. Then we solve this problem using arguments from Convex Geometry and Delzant theory. Applications to symplectic blowing-up are also presented, and some further questions are raised in the last section.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.