ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Question 46 (A. Katok). Construct periodic orbits for triangular billiards.

Every acute triangle has one obvious periodic orbit, but it is not known whether a general acute triangle has other periodic orbits. It is also not known whether a general obtuse triangle has at least one periodic orbit. Periodic orbits were constructed for some special classes of triangles (see [66, 83, 35, 77, 171]). Recently, a computer aided proof, which uses the program McBilliards [84], was found that shows that every triangle with all angles less than 100 degrees has a periodic orbit (see [172]). The situation is much better for rational triangles and polygons (i.e., if the angles are rational multiples of π). Unfolding the billiard table, one can construct a compact Riemannian surface with a flat structure so that billiard trajectories correspond to geodesics on this surface (see [141] for a survey). Using this technique, it was shown that the number N (T ) of periodic orbits of length at most T is bounded from above and below by quadratic polynomials in T (see [137, 138]). Moreover, for some billiard table this number has qua-dratic asymptotics (see [193, 194, 52, 51]), but it seems unknown whether the quadratic asymptotics holds for rational polygons in general. Note that the convergence N (T ) → ∞ cannot be uniform even on a compact set of triangles. In fact, it was announced by R. E. Schwatz that for any given any ε > 0 there exists a triangle, within ε of the 30-60-90 triangle, which has no periodic paths of length less than 1 /ε.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.