Coprime mappings and lonely runners

From MaRDI portal
(Redirected from Publication:6074959)



Abstract: For x real, let x be the fractional part of x (i.e. x=x−lfloorxfloor). The lonely runner conjecture can be stated as follows: for any n positive integers v1<v2<dots<vn there exists a real number t such that 1/(n+1)levitlen/(n+1) for i=1,dots,n. In this paper we prove that if epsilon>0 and n is sufficiently large (relative to epsilon) then such a t exists for any collection of positive integers v1<v2<dots<vn such that vn<(2−epsilon)n. This is an approximate version of a natural next step for the study of the lonely runner conjecture suggested by Tao. The key ingredient in our proof is a result on coprime mappings. Let A and B be sets of integers. A bijection f:AoB is a coprime mapping if a and f(a) are coprime for every ainA. We show that if A,Bsubset[n] are intervals of length 2m where m=eOmega((loglogn)2) then there exists a coprime mapping from A to B. We do not believe that this result is sharp.












This page was built for publication: Coprime mappings and lonely runners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074959)