ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let v1,…,vnv_1,\ldots,v_n be positive integers, and let

ML⁡(v1,…,vn)=max⁡t∈Rmin⁡1≤i≤n∥tvi∥,\operatorname{ML}(v_1,\ldots,v_n)=\max_{t\in\mathbb{R}}\min_{1\leq i\leq n}\lVert tv_i\rVert,

where ∥x∥\lVert x\rVert denotes the absolute distance from xx to the nearest integer. The Loneliness Spectrum Conjecture. One has either

∃s∈N,ML⁡(v1,…,vn)=sns+1,\exists s\in\mathbb{N},\quad \operatorname{ML}(v_1,\ldots,v_n)=\frac{s}{ns+1},

or

ML⁡(v1,…,vn)≥1n.\operatorname{ML}(v_1,\ldots,v_n)\geq\frac{1}{n}.

This conjecture refines the Lonely Runner Conjecture by describing the possible values below 1/n1/n. Kravitz proved it for n=3n=3, but the paper gives counterexamples for n=4n=4 and n=6n=6, so the conjecture is refuted.

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.