Rigid-flexible values for symplectic embeddings of four-dimensional ellipsoids into almost-cubes
Abstract
We consider the embedding function cb(a) describing the problem of symplectically embedding an ellipsoid E(1,a) into the smallest possible scaling by λ>1 of the polydisc P(1,b). In particular, we calculate rigid-flexible values, i.e. the minimum a such that for E(1,a') with a'>a, the embedding problem is determined only by volume. For 1<b<2 we find that these values vary piecewise smoothly outside the discrete set b∈(n+1n)2. As Jin and Lee analyze packing stability in the caes b>2, our results complete the story outside of a discrete set.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.