Covering radii of $3$-zonotopes and the shifted Lonely Runner Conjecture
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918488723947520 |
|---|---|
| author | Alcántara, David Criado, Francisco Santos, Francisco |
| author_facet | Alcántara, David Criado, Francisco Santos, Francisco |
| contents | We show that the shifted Lonely Runner Conjecture (sLRC) holds for 5 runners. We also determine that there are exactly 3 primitive tight instances of the conjecture, only two of which are tight for the non-shifted conjecture (LRC). Our proof is computational, relying on a rephrasing of the sLRC in terms of covering radii of certain zonotopes (Henze and Malikiosis, 2017), and on an upper bound for the (integer) velocities to be checked (Malikiosis, Santos and Schymura, 2024+).
As a tool for the proof, we devise an algorithm for bounding the covering radius of rational lattice polytopes, based on constructing dyadic fundamental domains. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_13379 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Covering radii of $3$-zonotopes and the shifted Lonely Runner Conjecture Alcántara, David Criado, Francisco Santos, Francisco Combinatorics Computational Geometry 52C17 (Primary), 52C07, 52B20, 52-04 I.3.5; G.2.1 We show that the shifted Lonely Runner Conjecture (sLRC) holds for 5 runners. We also determine that there are exactly 3 primitive tight instances of the conjecture, only two of which are tight for the non-shifted conjecture (LRC). Our proof is computational, relying on a rephrasing of the sLRC in terms of covering radii of certain zonotopes (Henze and Malikiosis, 2017), and on an upper bound for the (integer) velocities to be checked (Malikiosis, Santos and Schymura, 2024+). As a tool for the proof, we devise an algorithm for bounding the covering radius of rational lattice polytopes, based on constructing dyadic fundamental domains. |
| title | Covering radii of $3$-zonotopes and the shifted Lonely Runner Conjecture |
| topic | Combinatorics Computational Geometry 52C17 (Primary), 52C07, 52B20, 52-04 I.3.5; G.2.1 |
| url | https://arxiv.org/abs/2506.13379 |