A dyadic-denominator conjecture for lonely runner instances
Statement
Let be a speed vector with , and let a suitable time mean a time at which the speeds in form a lonely runner instance. Let and be the parameters appearing in the speed vector, let be a natural number, and let denote the ceiling function.
Dyadic-denominator conjecture. For every with , there is always a suitable time of the form
for some natural number .
The claim proposes an explicit restricted family of denominators containing a suitable time for every primitive speed vector. It is presented as a continuation of results giving explicit suitable times for known families; its general validity is open.
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.