The embedding capacity of 4-dimensional symplectic ellipsoids
Dusa McDuff, Felix Schlenk

TL;DR
This paper investigates the symplectic embedding capacity function of 4-dimensional ellipsoids, revealing a complex structure linked to Fibonacci numbers and contact homology, with explicit formulas and inequalities established.
Contribution
It provides explicit calculations of the embedding capacity function, connects it to Fibonacci numbers and contact homology, and proves new inequalities between symplectic capacities.
Findings
The function c(a) is piecewise linear below a certain threshold and matches the square root for large a.
Explicit formulas for c(a) are derived on specific intervals, involving Fibonacci ratios.
The contact homology capacity c_{ECH} is shown to coincide with c(a), establishing a key inequality.
Abstract
This paper calculates the function whose value at is the infimum of the size of a ball that contains a symplectic image of the ellipsoid . (Here is the ratio of the area of the large axis to that of the smaller axis.) The structure of the graph of is surprisingly rich. The volume constraint implies that is always greater than or equal to the square root of , and it is not hard to see that this is equality for large . However, for less than the fourth power of the golden ratio, is piecewise linear, with graph that alternately lies on a line through the origin and is horizontal. We prove this by showing that there are exceptional curves in blow ups of the complex projective plane whose homology classes are given by the continued fraction expansions of ratios of Fibonacci numbers. On the interval we find…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
