Lower bounds on the number of closed trajectories of generalized billiards

Mathematics – Differential Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages

Scientific paper

Given a domain or, more generally, a Riemannian manifold with boundary, a billiard is the motion of a particle when the field of force is absent. Trajectories of such a motion are geodesics inside the domain; and the particle reflects from the boundary making the angle of incidence equal the angle of reflection. The billiard motion can happen to be a closed (or periodic) one when the billiard ball rebounds k times and then gets to the initial position with the same speed vector as in the beginning. The study of closed billiard trajectories is due to George Birkhoff who in 1927 proved a lower estimate for the number of closed billiard trajectories of a certain period k. We consider the most general case when the billiard ball reflects from an arbitrary submanifold of a Euclidean space. We prove Morse inequalities in this situation and apply them to find a lower estimate for the number of closed billiard trajectories of any prime period in terms of Betti numbers of the given manifold.

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

Lower bounds on the number of closed trajectories of generalized billiards 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 Lower bounds on the number of closed trajectories of generalized billiards, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds on the number of closed trajectories of generalized billiards will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-286480

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