Symplectic embeddings of polydisks

By Larry Guth. 2007

82 citations recorded by the source corpus.

If P and P′ are symplectic polydisks of radii R1≤...≤Rn and R1′≤...≤Rn′, respectively, then we prove that P symplectically embeds in P′ provided that C(n)R1≤R1′ and C(n)R1...Rn≤R1′...Rn′. Up to a constant factor, these conditions are optimal.

Subfields: Applied Mathematics, Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/0cdefd1639821d6dab3b23fafdd6e5d01dfe8907

How researchers see this paper

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

In Applied Mathematics

  1. Daniel Cristofaro-Gardiner
  2. Michael Hutchings
  3. D. Mcduff
  4. Michael Usher
  5. V. G. B. Ramos
  6. D. Frenkel
  7. Keon Choi
  8. F. Schlenk

In Computational Theory and Mathematics

  1. Michael Hutchings
  2. Daniel Cristofaro-Gardiner
  3. F. Schlenk
  4. D. Mcduff
  5. V. G. B. Ramos
  6. Michael Usher
  7. Jean Gutt
  8. Clifford H. Taubes

In Geometry and Topology

  1. Daniel Cristofaro-Gardiner
  2. F. Schlenk
  3. Michael Hutchings
  4. D. Mcduff
  5. Michael Usher
  6. V. G. B. Ramos
  7. D. Frenkel
  8. Keon Choi

Citations in the corpus