About: Lonely runner conjecture

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Lonely runner conjecture Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatDiophantineEquations, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FLonely_runner_conjecture&invfp=IFP_OFF&sas=SAME_AS_OFF

In number theory, specifically the study of Diophantine approximation, the lonely runner conjecture is a conjecture about the long-term behavior of runners on a circular track. It states that runners on a track of unit length, with constant speeds all distinct from one another, will each be lonely at some time—at least units away from all others.

Attributes	Values
rdf:type	yago:WikicatConjectures yago:Abstraction100002137 yago:Cognition100023271 yago:Communication100033020 yago:Concept105835747 yago:Content105809192 yago:Equation106669864 yago:Hypothesis105888929 yago:Hypothesis107162545 yago:Idea105833840 yago:MathematicalStatement106732169 yago:Message106598915 yago:Proposal107162194 yago:PsychologicalFeature100023100 yago:WikicatHypotheses yago:Speculation105891783 yago:Statement106722453 yago:WikicatDiophantineEquations
rdfs:label	Vermutung des einsamen Läufers (de) Conjetura del corredor solitario (es) Conjecture du coureur solitaire (fr) Lonely runner conjecture (en) Гипотеза об одиноком бегуне (ru)
rdfs:comment	Als Vermutung des einsamen Läufers (auch Lonely Runner Vermutung) wird in der Zahlentheorie und insbesondere in der diophantischen Approximation eine ursprünglich von Jörg Wills im Jahr 1967 geäußerte Vermutung bezeichnet. Ihren Namen erhielt die Vermutung des einsamen Läufers 1998 von Luis Goddyn. Anwendungen hat die Vermutung zum Beispiel in der Approximation von irrationalen Zahlen durch rationale Zahlen, aber auch in der Graphentheorie. Die Vermutung ist noch ungelöst, was ihr, zusammen mit der allgemeinverständlichen Formulierbarkeit, eine gewisse Bekanntheit verschafft hat. (de) En teoría de números y, especialmente en el estudio de , la conjetura del corredor solitario es una conjetura debida originalmente a J. M. Wills en 1967. Las aplicaciones de la conjetura en las matemáticas son variadas; incluyen problemas de y cálculo del número cromático de y . L. Goddyn le dio, en 1998, su pintoresco nombre a la conjetura. (es) En mathématiques, et plus particulièrement dans l'étude de l'approximation diophantienne, la conjecture du coureur solitaire est une conjecture formulée par John M. Wills en 1967. Les applications de cette conjecture balayent de nombreux domaines des mathématiques : problèmes d', calculs de nombres chromatiques, etc.Le nom pittoresque de cette conjecture a été proposée par Luis Goddyn en 1998. (fr) В теории игр, особенно при изучении диофантовых приближений, гипотеза об одиноком бегуне — это гипотеза, выдвинутая Уиллсом (J. M. Wills) в 1967. Приложения гипотезы широко представлены в математике, они включают задачи ограничения обзора и вычисления хроматического числа дистанционных и циркулянтных графов. Гипотеза получила образное имя благодаря Годдину (L. Goddyn) в 1998. (ru) In number theory, specifically the study of Diophantine approximation, the lonely runner conjecture is a conjecture about the long-term behavior of runners on a circular track. It states that runners on a track of unit length, with constant speeds all distinct from one another, will each be lonely at some time—at least units away from all others. (en)
foaf:depiction
dcterms:subject	Conjectures Diophantine equations Unsolved problems in number theory
Wikipage page ID	19538953 (xsd:integer)
Wikipage revision ID	1120425151 (xsd:integer)
Link from a Wikipage to another Wikipage	Nowhere-zero flow Algebraic function field Conjectures Chromatic number Modular arithmetic Conjecture Half-integer Mathematika Number theory Diophantine approximation Directed graph Discrete Mathematics (journal) Fractional part Graph theory Journal of Number Theory Hypercube Diophantine equations Unsolved problems in number theory Aequationes Mathematicae Big O notation Connected component (graph theory) Monatshefte für Mathematik The Electronic Journal of Combinatorics Dirichlet approximation theorem Journal of Combinatorial Theory, Series A Journal of Combinatorial Theory, Series B
Link from a Wikipage to an external page	https://zh.booksc.eu/book/1944302/9bd583 https://basepub.dauphine.fr/handle/123456789/6201 http://people.math.sfu.ca/~goddyn/Papers/063tight_lonely_runner.pdf http://www.openproblemgarden.org/%3Fq=op/lonely_runner_conjecture http://hrcak.srce.hr/file/102788 http://wrap.warwick.ac.uk/125495/7/WRAP-lonely-runners-function-fields-Chow-2019.pdf
sameAs	Lonely runner conjecture Lonely runner conjecture Lonely runner conjecture Lonely runner conjecture Lonely runner conjecture Lonely runner conjecture Lonely runner conjecture Lonely runner conjecture Lonely runner conjecture
dbp:wikiPageUsesTemplate	dbt:Anchor dbt:Cite_journal dbt:Efn dbt:Good_article dbt:Harvtxt dbt:Mvar dbt:Notelist dbt:Refbegin dbt:Refend dbt:Reflist dbt:Sfn dbt:Sfnm dbt:Short_description dbt:Unsolved
thumbnail	wiki-commons:Special:FilePath/Lonely_runner.gif?width=300
4a	Renault (en)
4y	2004 (xsd:integer)
1a	Wills (en) Cusick (en) Betke (en) Pomerance (en)
1p	133 (xsd:integer)

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software