ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A combinatorial period length is the number of line segments in a periodic trajectory on the regular pentagon; a trajectory is asymmetric when it does not have 5-fold rotational symmetry. Davis–Lelièvre's local-global conjecture. Every sufficiently large even number arises as an asymmetric combinatorial period length on the regular pentagon. More precisely, every positive even integer except 22, 1212, 1414 and 1818 occurs. This conjecture was motivated by extensive numerical analysis of closed trajectories and concerns the complete set of asymmetric combinatorial period lengths.

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 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.