Iteration theory of $L$-index and Multiplicity of brake orbits

Mathematics – Symplectic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

58 pages, submitted

Scientific paper

In this paper, we first establish the Bott-type iteration formulas and some abstract precise iteration formulas of the Maslov-type index theory associated with a Lagrangian subspace for symplectic paths. As an application, we prove that there exist at least $[\frac{n}{2}]+1$ geometrically distinct brake orbits on every $C^2$ compact convex symmetric hypersurface $\Sigma$ in $\mathbb{R}^{2n}$ satisfying the reversible condition $N\Sigma=\Sigma$, furthermore, if all brake orbits on this hypersurface are nondegenerate, then there are at least $n$ geometrically distinct brake orbits on it. As a consequence, we show that there exist at least $[\frac{n}{2}]+1$ geometrically distinct brake orbits in every bounded convex symmetric domain in $\mathbb{R}^{n}$, furthermore, if all brake orbits in this domain are nondegenerate, then there are at least $n$ geometrically distinct brake orbits in it. In the symmetric case, we give a positive answer to the Seifert conjecture of 1948 under a generic condition.

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

Iteration theory of $L$-index and Multiplicity of brake orbits 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 Iteration theory of $L$-index and Multiplicity of brake orbits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Iteration theory of $L$-index and Multiplicity of brake orbits will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-154596

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