# On the distribution of runners on a circle

## TL;DR

This paper proves that among runners on a circle with limited speed variations, there exists a sector with a higher-than-average concentration of runners, and generalizes this to roots of certain complex polynomials, linking to conjectures in computational complexity.

## Contribution

It establishes a new lower bound on the concentration of runners in a sector and generalizes this to roots of complex polynomials with bounded Newton polytope vertices, connecting to complexity conjectures.

## Key findings

- Existence of a sector with at least |S|n+Ω(√k) runners
- Generalization to roots of complex polynomials with bounded Newton polytope vertices
- Implication for the Real τ-Conjecture and Newton polytope conjecture

## Abstract

Consider $n$ runners running on a circular track of unit length with constant speeds such that $k$ of the speeds are distinct. We show that, at some time, there will exist a sector $S$ which contains at least $|S|n+ \Omega(\sqrt{k})$ runners. The result can be generalized as follows. Let $f(x,y)$ be a complex bivariate polynomial whose Newton polytope has $k$ vertices. Then there exists $a\in {\mathbb C}\setminus\{0\}$ and a complex sector $S=\{re^{\imath \theta}: r>0, \alpha\leq \theta \leq \beta\}$ such that the univariate polynomial $f(x,a)$ contains at least $\frac{\beta-\alpha}{2\pi}n+\Omega(\sqrt{k})$ non-zero roots in $S$ (where $n$ is the total number of such roots and $0\leq (\beta-\alpha)\leq 2\pi$). This shows that the Real $\tau$-Conjecture of Koiran implies the conjecture on Newton polytopes of Koiran et al.