Papers › Symplectic embeddings of four-dimensional ellipsoids into integral polydiscs
Symplectic embeddings of four-dimensional ellipsoids into integral polydiscs
Daniel Cristofaro-Gardiner, David Frenkel, Felix Schlenk
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.
In previous work, the second author and M\"uller determined the function c(a) giving the smallest dilate of the polydisc P(1,1) into which the ellipsoid E(1,a) symplectically embeds. We determine the function of two variables c_b(a) giving the smallest dilate of the polydisc P(1,b) into which the ellipsoid E(1,a) symplectically embeds for all integers b ⩾2. It is known that for fixed b, if a is sufficiently large then all obstructions to the embedding problem vanish except for the volume obstruction. We find that there is another kind of change of structure that appears as one instead increases b: the number-theoretic "infinite Pell stairs" from the b=1 case almost completely disappears (only two steps remain), but in an appropriately rescaled limit, the function c_b(a) converges as b tends to infinity to a completely regular infinite staircase with steps all of the same height and width.
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