Periodic reflecting paths in right triangles (Q1801622): Difference between revisions

In contrast to smooth convex boundaries the existence and variety of periodic billiard paths for a billiard table bounded by a convex polygon is an open problem which has been solved in particular cases only [see \textit{V. Klee} and \textit{S. Wagon}: Old and new unsolved problems in plane geometry and number theory, Vol. 11 in Dolciani Math. Expos., MAA (1991; Zbl 0784.51002)]. Here the case of a right triangle is discussed. The author obtains as his main result the following: Let \(\beta\) represent the smallest interior angle of some right triangle, and let \(N=\lceil \pi/ 2\beta \rceil-1\). Then each point interior to the shorter leg of the right triangle lies on a unique periodic reflecting path of \((4k+2)\) reflections per cycle for all \(k=1,2,\ldots,N-1\); and each point interior to some subsegment of the shorter leg lies on a unique periodic reflecting path of \(4N+2\) reflections per cycle. The main tool for obtaining these paths is to construct a rhombus or a fan from the given triangle by reflections at suitable sides such that periodic paths are represented by straight lines in the figures. The paths obtained have the property that every directed segment is traversed in both directions. Furthermore, it is shown that there are no periodic paths in right triangles of 3, 5, or 7 reflections per cycle.