Minimizing length of billiard trajectories in hyperbolic polygons
classification
🧮 math.DS
keywords
hyperboliclengthbilliardpolygonstrajectoriesaverageclosedpolygon
read the original abstract
Closed billiard trajectories in a polygon in the hyperbolic plane can be coded by the order in which they hit the sides of the polygon. In this paper, we consider the average length of cyclically related closed billiard trajectories in ideal hyperbolic polygons and prove the conjecture that this average length is minimized for regular hyperbolic polygons. The proof uses a strict convexity property of the geodesic length function in Teichm\"uller space with respect to the Weil-Petersson metric, a fundamental result established by Wolpert.
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.