Pith. sign in

REVIEW

The best possible quadratic refinement of Sendov's conjecture

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0312130 v2 pith:KWA337DA submitted 2003-12-05 math.CV

classification math.CV
keywords betaconjecturedegreepolynomialsrootssendovderivativepolynomial
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

A conjecture of Sendov states that if a polynomial has all its roots in the unit disk and if $\beta$ is one of those roots, then within one unit of $\beta$ lies a root of the polynomial's derivative. If we define $r(\beta)$ to be the greatest possible distance between $\beta$ and the closest root of the derivative, then Sendov's conjecture claims that $r(\beta) \le 1$. In this paper, we assume (without loss of generality) that $0 \le \beta \le 1$ and make the stronger conjecture that $r(\beta) \le 1-(3/10)\beta(1-\beta)$. We prove this new conjecture for all polynomials of degree 2 or 3, for all real polynomials of degree 4, and for all polynomials of any degree as long as all their roots lie on a line or $\beta$ is sufficiently close to 1.

Discussion (0). Continue with ORCID to comment.

Pith tools