← All problems

The 4n+24n+2 period conjecture for periodic trajectories on triangle tilings

8 years old · traced to

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.

4n+24n+2 conjecture. Every periodic trajectory on a triangle tiling has period 4n+24n+2 for some positive integer nn.

It is therefore solved.

References

Status

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.