SearcharxivSearch

arXiv · 1906.02511

On the distribution of runners on a circle

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+ Ω(\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 θ}: r>0, α\leq θ\leq β\}$ such that the univariate polynomial $f(x,a)$ contains at least $\frac{β-α}{2π}n+Ω(\sqrt{k})$ non-zero roots in $S$ (where $n$ is the total number of such roots and $0\leq (β-α)\leq 2π$). This shows that the Real $τ$-Conjecture of Koiran implies the conjecture on Newton polytopes of Koiran et al.

Explore related subjects

Keep this discovery

BibTeXRIS

Pavel Hrubes. 2020-04-05. On the distribution of runners on a circle. https://arxiv.org/abs/1906.02511

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC