Skip Navigation



Journal of Topology Advance Access published online on February 25, 2009
Journal of Topology, doi:10.1112/jtopol/jtn031
This Article
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
2/1/1    most recent
jtn031v1
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by McDuff, D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2009 London Mathematical Society

Symplectic embeddings of 4-dimensional ellipsoids

Dusa McDuff

Department of Mathematics, Barnard College, Columbia University, New York, NY 10027-6598, USA dusa@math.columbia.edu


  Abstract

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 CP2. 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 CP2, 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.

Received March 31, 2008.

2000 Mathematics Subject Classification 53D05


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.