Computability and the growth rate of symplectic homology

Details Computability and the growth rate of symplectic homology Computability and the growth rate of symplectic homology

2011-09-21

arxiv.org/abs/1109.4466v1

Mathematics

Symplectic Geometry

84 pages, 2 figures

Scientific paper

For each n greater than 7 we explicitly construct a sequence of Stein manifolds diffeomorphic to complex affine space of dimension n so that there is no algorithm to tell us in general whether a given such Stein manifold is symplectomorphic to the first one or not. We prove a similar undecidability result for contact structures on the 2n - 1 dimensional sphere. We can generalize these results by replacing com- plex affine space with any smooth affine variety of dimension n and the 2n - 1 dimensional sphere with any smooth affine variety intersected with a sufficiently large sphere. We prove these theorems by using an invariant called the growth rate of symplectic homology to reduce these problems to an undecidability result for groups.

Affiliated with

Also associated with

No associations

Rating

Computability and the growth rate of symplectic homology does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computability and the growth rate of symplectic homology, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computability and the growth rate of symplectic homology will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-256948