{"id":"https://openalex.org/W7157089426","doi":"https://doi.org/10.48550/arxiv.2604.23906","title":"Eleven, twelve, and thirteen lonely runners","display_name":"Eleven, twelve, and thirteen lonely runners","publication_year":2026,"publication_date":"2026-04-26","ids":{"openalex":"https://openalex.org/W7157089426","doi":"https://doi.org/10.48550/arxiv.2604.23906"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.23906","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23906","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.23906","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032005176","display_name":"Touch Sungkawichai","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sungkawichai, Touch","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029843733","display_name":"Tanupat Trakulthongchai","orcid":"https://orcid.org/0000-0002-8647-2310"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Trakulthongchai, Tanupat","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032005176"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.3903000056743622,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.3903000056743622,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.22519999742507935,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11166","display_name":"Analytic Number Theory Research","score":0.18310000002384186,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.8496000170707703},{"id":"https://openalex.org/keywords/statement","display_name":"Statement (logic)","score":0.628600001335144},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.4871000051498413},{"id":"https://openalex.org/keywords/lonely-runner-conjecture","display_name":"Lonely runner conjecture","score":0.41609999537467957},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.37630000710487366},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.34869998693466187}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.8496000170707703},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6919000148773193},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.628600001335144},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5490000247955322},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.4871000051498413},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4828000068664551},{"id":"https://openalex.org/C78635031","wikidata":"https://www.wikidata.org/wiki/Q6671695","display_name":"Lonely runner conjecture","level":4,"score":0.41609999537467957},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.37630000710487366},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.34869998693466187},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3391000032424927},{"id":"https://openalex.org/C51641817","wikidata":"https://www.wikidata.org/wiki/Q508173","display_name":"Beal's conjecture","level":3,"score":0.3086000084877014},{"id":"https://openalex.org/C128814272","wikidata":"https://www.wikidata.org/wiki/Q837314","display_name":"Collatz conjecture","level":3,"score":0.29010000824928284},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C67101536","wikidata":"https://www.wikidata.org/wiki/Q5535910","display_name":"George (robot)","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27549999952316284}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.23906","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23906","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.23906","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.23906","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"score":0.4035978317260742,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Wills":[0],"conjectured":[1],"that,":[2,15],"for":[3,16,55,103],"any":[4,75],"non-zero":[5],"integers":[6],"$u_1,\\ldots,u_k$,":[7],"there":[8],"is":[9,24,35],"a":[10,68,95],"real":[11],"number":[12],"$t$":[13],"such":[14],"all":[17],"$i=1,\\ldots,k$,":[18],"\\[\\lVert":[19],"tu_i\\rVert\\geq\\frac{1}{k+1},\\]":[20],"where":[21],"$\\lVert":[22],"x\\rVert$":[23],"the":[25,30,38,49,53,80,99],"distance":[26],"from":[27],"$x$":[28],"to":[29,72],"closest":[31],"integer.":[32],"This":[33],"statement":[34],"known":[36],"as":[37],"Lonely":[39,100],"Runner":[40,101],"Conjecture.":[41],"A":[42],"computational":[43],"method":[44,61,70],"developed":[45],"by":[46],"Rosenfeld":[47],"and":[48,66,84],"second":[50],"author":[51],"verified":[52],"conjecture":[54,81],"$k\\leq9$.":[56],"We":[57],"further":[58],"refine":[59],"this":[60],"with":[62,77],"new":[63],"sieving":[64],"techniques":[65],"employ":[67],"polynomial":[69],"argument":[71],"show":[73],"that":[74],"$(u_1,\\ldots,u_k)\\equiv(1,2,\\ldots,k)\\pmod{p}$":[76],"$\\gcd(u_1,\\ldots,u_k)=1$":[78],"satisfies":[79],"when":[82],"$k+1$":[83],"$p":[85],">":[86],"k^2+k$":[87],"are":[88],"both":[89],"odd":[90],"primes.":[91],"Ultimately,":[92],"we":[93],"provide":[94],"computer-assisted":[96],"proof":[97],"of":[98],"Conjecture":[102],"$k\\in\\{10,11,12\\}$.":[104]},"counts_by_year":[],"updated_date":"2026-04-29T06:16:36.941037","created_date":"2026-04-29T00:00:00"}