Sendov radius constant
Let f:ℂ→ℂ be a polynomial of degree n≥ 2 whose zeroes all lie in the closed unit disk D(0,1)=\z:lvert zrvert≤ 1\. Sendov's conjecture states that if λ_0 is one of these zeroes, then f' has at least one zero in D(λ_0,1). every zero λ_0 of f has a critical point in D(λ_0,1).
From the catalogue. Imported from Terence Tao and contributors (optimizationproblems repository) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.
Cite
@misc{cairn-constant-69a-sendov-radius-constant,
title = {Sendov radius constant},
author = {{Cairn Commons contributors}},
howpublished = {\url{https://cairn-commons.com/problems/constant-69a-sendov-radius-constant}},
year = {2026},
note = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-09-29}
} Also: CITATION.cff · Atom feed of results
- Claims
- 0
- Verified
- 0
- Disputed
- 0
- Refuted
- 0
- On the literature board
- 0
Current state
No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.
The problem
Description of constant
Let be a polynomial of degree whose zeroes all lie in the closed unit disk . Sendov's conjecture states that if is one of these zeroes, then has at least one zero in .
<a href="#Tao2022-sendov-statement">[Tao2022-sendov-statement]</a>
We define the Sendov radius constant by
With this definition, Sendov's conjecture is equivalent to . <a href="#Tao2022-sendov-statement">[Tao2022-sendov-statement]</a>
A standard example gives : take and , for which the zeroes of are at the origin and lie on . <a href="#Tao2022-example-zn1">[Tao2022-example-zn1]</a>
A trivial geometric bound gives (all zeroes of and lie in ).
Hence the best established range currently is
Known upper bounds
| Bound | Reference | Comments |
|---|---|---|
| Trivial geometric bound since all zeroes of and lie in the closed unit disk. |
Known lower bounds
| Bound | Reference | Comments |
|---|---|---|
| [[Tao2022](#Tao2022)] | Example , : the critical points are at and lie on . <a href="#Tao2022-example-zn1">[Tao2022-example-zn1]</a> |
Additional comments and links
- History surveys. Tao notes that there is a long history of partial results and points to several surveys. <a href="#Tao2022-surveys">[Tao2022-surveys]</a>
- Milestone status. Tao records that the conjecture is known for all , and proves it for all sufficiently large . <a href="#Tao2022-known-n-less-9">[Tao2022-known-n-less-9]</a> <a href="#Tao2022-high-degree">[Tao2022-high-degree]</a>
- Near-unit-circle regime. Tao's proof in this regime refines earlier Miller arguments and invokes Chijiwa's results in an extreme subregime. <a href="#Tao2022-near-unit-circle-history">[Tao2022-near-unit-circle-history]</a>
References
- <a id="Tao2022"></a>[Tao2022] Tao, Terence. Sendov’s conjecture for sufficiently-high-degree polynomials. Acta Mathematica 229 (2022), no. 2, 347-392 (December 2022). DOI: https://doi.org/10.4310/ACTA.2022.v229.n2.a3. Publisher page: https://projecteuclid.org/journals/acta-mathematica/volume-229/issue-2/Sendovs-conjecture-for-sufficiently-high-degree-polynomials/10.4310/ACTA.2022.v229.n2.a3.full. arXiv PDF: https://arxiv.org/pdf/2012.04125.pdf. Google Scholar
- <a id="Tao2022-sendov-statement"></a>[Tao2022-sendov-statement] loc: arXiv PDF p.1, Conjecture 1.1 quote: "Conjecture 1.1 (Sendov’s conjecture). Let be a polynomial of degree that has all zeroes in the closed unit disk . If is one of these zeroes, then has at least one zero in ."
- <a id="Tao2022-surveys"></a>[Tao2022-surveys] loc: arXiv PDF p.1, Introduction paragraph after Conjecture 1.1 quote: "There is a long history of partial results towards this conjecture; see for instance [17], [23], [24], [20], [25] for some surveys of results."
- <a id="Tao2022-known-n-less-9"></a>[Tao2022-known-n-less-9] loc: arXiv PDF p.1, Introduction paragraph after Conjecture 1.1 quote: "The conjecture is known for low degrees, and specifically for all [1]."
- <a id="Tao2022-high-degree"></a>[Tao2022-high-degree] loc: arXiv PDF p.2, Theorem 1.2 quote: "Sendov’s conjecture is true for all sufficiently large . That is, there exists an absolute constant such that Sendov’s conjecture holds for ."
- <a id="Tao2022-example-zn1"></a>[Tao2022-example-zn1] loc: arXiv PDF p.3, Example 1.4 quote: "For each , set , and . Then all the zeroes of lie in , and just barely has zeroes in since the zeroes are all at the origin which lies on the boundary circle ."
- <a id="Tao2022-near-unit-circle-history"></a>[Tao2022-near-unit-circle-history] loc: arXiv PDF p.1, Abstract quote: "for near the unit circle we refine a previous argument of Miller (and also invoke results of Chijiwa when is extremely close to the unit circle)"
- <a id="BrownXiang1999"></a>[BrownXiang1999] Brown, J. E.; Xiang, G. Proof of the Sendov conjecture for polynomials of degree at most eight. Journal of Mathematical Analysis and Applications 232 (1999), 272-292. Google Scholar
- <a id="Miller1993"></a>[Miller1993] Miller, M. J. On Sendov's conjecture for roots near the unit circle. Journal of Mathematical Analysis and Applications 175 (1993), no. 2, 632-639. Google Scholar
- <a id="Chijiwa2011"></a>[Chijiwa2011] Chijiwa, T. A quantitative result on Sendov's conjecture for a zero near the unit circle. Hiroshima Mathematical Journal 41 (2011), no. 2, 23-273. DOI: https://doi.org/10.32917/hmj/1314204564. Publisher page: https://projecteuclid.org/journals/hiroshima-mathematical-journal/volume-41/issue-2/A-quantitative-result-on-Sendovs-conjecture-for-a-zero-near/10.32917/hmj/1314204564.full. Google Scholar
What counts as progress
- A better upper or lower bound, with a proof or a construction whose value is re-computed by published code (reproducible), ideally with a certificate a deterministic checker can validate.
- A formal proof (Lean) of a known bound, or a precise error in a claimed one.
- New references for the tables above (literature claims).
Source and licence
Imported from the crowdsourced repository of optimization constants (Terence Tao and contributors), commit 2c1968cd520b, Apache License 2.0; reformatted for this page. New records should also be reported there.