scientific article; zbMATH DE number 5115930
From MaRDI portal
Publication:3415024
Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Lattices and convex bodies (number-theoretic aspects) (11H06) Simultaneous homogeneous approximation, linear forms (11J13) Diophantine inequalities (11J25) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)
Recommendations
- Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem
- Some remarks on the lonely runner conjecture
- View-obstruction: a shorter proof for 6 lonely runners
- Invisible runners in finite fields
- Coprime matchings
- Sequences of integers with three missing separations
- A note on the lonely runner conjecture
- On the Lonely Runner Conjecture.
- Coprime mappings and lonely runners
- scientific article; zbMATH DE number 5555985
Cited in
(13)- Guaranteed approach with the farthest of the runaways
- The lonely runner with seven runners
- The lonely runner problem for lacunary sequences
- Bounds for the lonely runner problems via linear programming
- Correlation among runners and some results on the lonely runner conjecture
- scientific article; zbMATH DE number 5919365 (Why is no real title available?)
- Some remarks on the lonely runner conjecture
- Random runners are very lonely
- Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem
- Coprime matchings
- LONELY RUNNERS IN FUNCTION FIELDS
- Coprime mappings and lonely runners
- Cosine sign correlation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415024)