2017
DOI: 10.2140/involve.2017.10.219
|View full text |Cite
|
Sign up to set email alerts
|

Symplectic embeddings of four-dimensional ellipsoids into polydiscs

Abstract: McDuff and Schlenk have recently determined exactly when a fourdimensional symplectic ellipsoid symplectically embeds into a symplectic ball. Similarly, Frenkel and Müller have recently determined exactly when a symplectic ellipsoid symplectically embeds into a symplectic cube. Symplectic embeddings of more complicated structures, however, remain mostly unexplored. We study when a symplectic ellipsoid E(a, b) symplectically embeds into a polydisc P (c, d). We prove that there exists a constant C depending only… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
12
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(12 citation statements)
references
References 14 publications
0
12
0
Order By: Relevance
“…The function c B (a) has three parts: On [1, τ 4 ], with τ = 1+ √ 5 2 the golden ratio, c B is given by the "Fibonacci stairs", namely an infinite stairs each of whose steps is made of a segment on a line going through the origin and a horizontal segment, with foot-points on the volume constraint √ a, and both the foot-points and the edge determined by Fibonacci numbers. Then there is one step over [τ 4 , 7 1 9 ], whose left part over [τ 4 , 7] is affine but non-linear: c B (a) = a+1 3 . Finally, for a 7 1 9 the graph of c B (a) is given by eight strictly disjoint steps made of two affine segments, and c B (a) = √ a for a 8 1 36 .…”
Section: Introduction and Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…The function c B (a) has three parts: On [1, τ 4 ], with τ = 1+ √ 5 2 the golden ratio, c B is given by the "Fibonacci stairs", namely an infinite stairs each of whose steps is made of a segment on a line going through the origin and a horizontal segment, with foot-points on the volume constraint √ a, and both the foot-points and the edge determined by Fibonacci numbers. Then there is one step over [τ 4 , 7 1 9 ], whose left part over [τ 4 , 7] is affine but non-linear: c B (a) = a+1 3 . Finally, for a 7 1 9 the graph of c B (a) is given by eight strictly disjoint steps made of two affine segments, and c B (a) = √ a for a 8 1 36 .…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…The reduction method is thus quite "local in a". While it is usually impossible to compute c b (a) by Method 3 (see however [4,14]), this method is very useful for guessing the graph of c b (a), since using (2.15) and a computer one gets good lower bounds for c b (a). Accordingly, we have found Theorem 1.1 as follows.…”
Section: Since the Embedding Problems E(1 A)mentioning
confidence: 99%
See 3 more Smart Citations