Symplectic embeddings of 4‐dimensional ellipsoids

By D. Mcduff. 2008

97 citations recorded by the source corpus.

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 ℂP2. 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 ℂP2, 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 ⩾ 9, thus answering a question raised by Hofer.

Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/08709e65a05c73cbc846bc751ab7a4e904365eed

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

  1. F. Schlenk
  2. D. Mcduff
  3. J. Latschev
  4. Michael Hutchings
  5. Yong-Geun Oh
  6. Christopher Woodward
  7. Tian-Jun Li
  8. Weiwei Wu

In Geometry and Topology

  1. F. Schlenk
  2. D. Mcduff
  3. J. Latschev
  4. Michael Hutchings
  5. Michael Usher
  6. Yong-Geun Oh
  7. Daniel Cristofaro-Gardiner
  8. Y. Ostrover

Citations in the corpus