Papers › Symplectic embeddings of 4-dimensional ellipsoids
Symplectic embeddings of 4-dimensional ellipsoids
Dusa McDuff
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We show how to reduce the problem of symplectically embedding one 4-dimensional rational ellipsoid into another to a problem of embedding disjoint unions of balls into appropriate blow ups of \C P^2. For example, the problem of embedding the ellipsoid E(1,k) into a ball B is equivalent to that of embedding k disjoint equal balls into \C P^2, and so can be solved by the work of Gromov, McDuff--Polterovich and Biran. (Here k is the ratio of the area of the major axis to that of the minor axis.) As a consequence we show that the ball may be fully filled by the ellipsoid E(1,k) for k=1,4 and all k\ge 9, thus answering a question raised by Hofer.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections