pith. sign in

arxiv: 0901.0441 · v1 · pith:4DQWJNDMnew · submitted 2009-01-05 · 🧮 math.DS

Back to balls in billiards

classification 🧮 math.DS
keywords backalmostconvergenceinitialpointarbitrarilyballsbilliard
0
0 comments X
read the original abstract

We consider a billiard in the plane with periodic configuration of convex scatterers. This system is recurrent, in the sense that almost every orbit comes back arbitrarily close to the initial point. In this paper we study the time needed to get back in an r-ball about the initial point, in the phase space and also for the position, in the limit when r->0. We establish the existence of an almost sure convergence rate, and prove a convergence in distribution for the rescaled return times.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.