most citedLinearly-exponential checking is enough for the Lonely Runner Conjecture and some of its variants

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2024★ 2 cited

Linearly-exponential checking is enough for the Lonely Runner Conjecture and some of its variants

Romanos Diogenes Malikiosis, Francisco Santos, Matthias Schymura

Tao (2018) showed that in order to prove the Lonely Runner Conjecture (LRC) up to runners it suffices to consider positive integer velocities in the order of . Us…

math.CO2023

Ewald's Conjecture and integer points in algebraic and symplectic toric geometry

Luis Crespo, Álvaro Pelayo, Francisco Santos

We solve several open problems concerning integer points of polytopes arising in symplectic and algebraic geometry. In this direction we give the first proof of a broad case of Ewa…