arXiv (All)
open access
More (shifted) runners, less loneliness
The shifted lonely runner conjecture was recently disproved by Blanco, Criado and Santos. We give quantitative bounds on its failure as the number of runners grows. The loneliness of a configuration is the maximum, over time, of the distance from the origin to the nearest runner. We write $1/(n+1+E_
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A tris of perfect matchings in bridgeless claw-free cubic graphs#1064662
- The Bridge-or-Trap Model of Companion AI: When Emotional Support Connects or Substitutes.#1001888
- R scripts for: Social Belonging, Mattering and NEET Status: Understanding Loneliness in Emerging Adulthood in Norway#245597
- Crack growth resistance curves and stick-slip fracture instabilities#329664
- Replication data for: When do campaign effects persist for years? Evidence from a natural experiment#461128
Record · ID 1050141
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive