The 4n+2 period conjecture for periodic trajectories on triangle tilings
Statement
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 .
The source says that Hubert and Paris-Romaskevich subsequently proved this conjecture. It is therefore solved.
Record
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.