An Explicit High-Degree Threshold for Sendov's Conjecture

Jeff Pickhardt

Omniscience Project

Papers Contact

An Explicit High-Degree Threshold for Sendov's Conjecture

/ …

110%

Loading document…

An Explicit High-Degree Threshold for Sendov's Conjecture

Abstract

Let p be a polynomial of degree n ≥2 whose zeros lie in the closed unit disk. Sendov’s conjecture asserts that every zero aof plies within distance 1 of a zero of p′. Tao proved that the conjecture holds for all sufficiently large degrees, but the compactness and unique-continuation arguments in his proof did not provide an explicit threshold. We give an effective version. Specifically, we prove that Sendov’s conjecture holds whenever n ≥ exp(10^126).

File Details

v1 paper.pdf

Omniscience Project

Accelerating research for the AI era.

Research

Papers Blog

About Us

About Contact

Legal

Terms Privacy