A Maslov Map for Coisotropic Submanifolds, Leaf-wise Fixed Points and Presymplectic Non-Embeddings

Mathematics – Symplectic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

47 pages

Scientific paper

Let $(M,\omega)$ be a symplectic manifold, $N\subseteq M$ a coisotropic submanifold, and $\Sigma$ a compact oriented (real) surface. I define a natural Maslov index for each continuous map $u:\Sigma\to M$ that sends every connected component of $\partial\Sigma$ to some isotropic leaf of $N$. This index is real valued and generalizes the usual Lagrangian Maslov index. The idea is to use the linear holonomy of the isotropic foliation of $N$ to compensate for the loss of boundary data in the case codimension $N<\dim M/2$. The definition is based on the Salamon-Zehnder (mean) Maslov index of a path of linear symplectic automorphisms. I prove a lower bound on the number of leafwise fixed points of a Hamiltonian diffeomorphism, if $(M,\omega)$ is geometrically bounded and $N$ is closed, regular (i.e. "fibering"), and monotone. As an application, we obtain a presymplectic non-embedding result. I also prove a coisotropic version of the Audin conjecture.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Maslov Map for Coisotropic Submanifolds, Leaf-wise Fixed Points and Presymplectic Non-Embeddings 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 A Maslov Map for Coisotropic Submanifolds, Leaf-wise Fixed Points and Presymplectic Non-Embeddings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Maslov Map for Coisotropic Submanifolds, Leaf-wise Fixed Points and Presymplectic Non-Embeddings will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-685870

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.