Polygons in billiard orbits
classification
🧮 math.NT
keywords
billiardpolygonsorbitsareasbilliardsbounddifferentgeometry
read the original abstract
We study the geometry of billiard orbits on rectangular billiards. A truncated billiard orbit induces a partition of the rectangle into polygons. We prove that thirteen is a sharp upper bound for the number of different areas of these polygons.
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.