The period conjecture for periodic trajectories on triangle tilings
A triangle tiling is the edge-to-edge tiling of the plane by congruent copies of a triangle. The period of a periodic trajectory is the number of iterations, or equivalently the number of repeated trajectory steps, in its minimal return.
conjecture. Every periodic trajectory on a triangle tiling has period for some positive integer .
It is therefore solved.
References
Status
- Solved: Olga Paris-Romaskevich and Pascal Hubert. Triangle Tiling Billiards and the Exceptional Family of their Escaping Trajectories: Circumcenters and Rauzy Gasket (Experimental Mathematics, 2022) https://www.tandfonline.com/doi/full/10.1080/10586458.2019.1583615
Source: Paul Baird-Smith, Diana Davis, Elijah Fromm and Sumun Iyer, “Tiling Billards on Triangle Tilings, and Interval Exchange Transformations”, arXiv:1809.07876 (2018).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.