Matching Tag: lonely-runner-conjecture
For positive integers v 1 , v 2 , v 3 , v 4 v_1,v_2,v_3,v_4 v 1 , v 2 , v 3 , v 4 with gcd ( v 1 , v 2 , v 3 , v 4 ) = 1 \gcd(v_1,v_2,v_3,v_4)=1 g cd( v 1 , v 2 , v 3 , v 4 ) = 1 , define M L ( v 1 , v 2 , v 3 , v 4 ) = max t ∈ R min 1 ≤ i ≤ 4 ∥ v i t ∥ \mathrm{ML}(v_1,v_2,v_3,v_4)=\max_{t\in\mathbb{R}}\min_{1\le i\le4}\|v_i t\| ML ( v 1 , v 2 , v 3 , v 4 ) = max t ∈ R min 1 ≤ i ≤ 4 ∥ v i t ∥ , where ∥ x ∥ \|x\| ∥ x ∥ denotes…
Given pairwise distinct positive velocities v 1 , … , v n ∈ R v_1,\dotsc,v_n \in \mathbb{R} v 1 , … , v n ∈ R and arbitrary starting points s 1 , … , s n ∈ R s_1,\dotsc,s_n \in \mathbb{R} s 1 , … , s n ∈ R , the distance from s j + t v j s_j+tv_j s j + t v j to the neare…
Cusick–Wills conjecture. For each i ∈ { 1 , … , k + 1 } i\in\{1,\ldots,k+1\} i ∈ { 1 , … , k + 1 } , there is a real number t t t such that
Let V = { v 1 , v 2 , … , v n } V=\{v_1,v_2,\dots,v_n\} V = { v 1 , v 2 , … , v n } be a set of n n n distinct positive integers, and define the maximum loneliness by … where T = R / Z \mathbf{T}=\mathbf{R}/\mathbf{Z} T = R / Z and…
Let n n n runners with distinct constant speeds run around the unit circle, starting at a common time and place. Identify the unit circle with T = R / Z \mathbf{T}=\mathbf{R}/\mathbf{Z} T = R / Z , and…
Let Z v Z_{\mathbf v} Z v be a Strong Lonely Runner Zonotope, meaning a Lonely Runner Zonotope associated with a velocity vector v = ( v 1 , … , v n ) ∈ Z > 0 n \mathbf v=(v_1,\dotsc,v_n)\in\mathbb{Z}_{>0}^n v = ( v 1 , … , v n ) ∈ Z > 0 n whose en…
Let Z = ∑ i = 1 n [ 0 , u i ] ⊆ R n − 1 Z=\sum_{i=1}^n[\mathbf{0},\mathbf{u}_i]\subseteq\mathbb{R}^{n-1} Z = ∑ i = 1 n [ 0 , u i ] ⊆ R n − 1 be a lattice zonotope of dimension n − 1 n-1 n − 1 with n n n generators, whose every n − 1 n-1 n − 1 generators are linearly indep…
Dyadic-denominator conjecture. For every n \mathbf{n} n with gcd ( n ) = 1 \gcd(\mathbf{n})=1 g cd( n ) = 1 , there is always a suitable time of the form
Let X X X be the random variable used in the paper to count the relevant loneliness events for a set of distinct speeds v 1 , … , v n v_1,\dots,v_n v 1 , … , v n , and let δ < 1 \delta<1 δ < 1 . Second-moment lower-bound…
Wills's conjecture. If 1 ≤ m 1 < m 2 < … < m k 1\le m_1<m_2<\ldots<m_k 1 ≤ m 1 < m 2 < … < m k , then