Untere Schranken für zwei diophantische Approximations-Funktionen
From MaRDI portal
Publication:2553463
DOI10.1007/BF01322924zbMath0239.10016OpenAlexW2078557945WikidataQ56566441 ScholiaQ56566441MaRDI QIDQ2553463
Publication date: 1972
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/177595
Related Items
Correlation among runners and some results on the lonely runner conjecture, View-obstruction: a shorter proof for 6 lonely runners, Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem, On the time for a runner to get lonely, Flows, view obstructions, and the lonely runner, Regular chromatic number and the lonely runner problem, View-Obstruction Problems. II, Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\), LONELY RUNNERS IN FUNCTION FIELDS, Lonely Runner Polyhedra, On a conjecture in diophantine approximations. II, The view-obstruction problem for \(n\)-dimensional cubes, On the chromatic number of circulant graphs, View-obstruction problems. III, On a conjecture in diophantine approximations. III, View-obstruction problem for 3-dimensional spheres
Cites Work
