A note on a recent attempt to prove Sendov's conjecture
N.A. Rather, Suhail Gulzar

TL;DR
This paper critiques a recent attempted proof of Sendov's conjecture, identifying errors and clarifying the fallacies in the previous work.
Contribution
It provides an analysis of the flawed proof attempt and clarifies the misconceptions in the recent claim.
Findings
The recent proof attempt contains logical errors.
The paper clarifies the fallacies in the attempted proof.
Sendov's conjecture remains unproven.
Abstract
Recently GM Sofi & SA Shabir [arXive: 1903.01850v2 [math.GM] 6 Mar 2019] made an attempt to prove the Sendov's conjecture. But unfortunately the proof is not correct. In this note, we discuss the fallacy in the proof.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Mathematics and Applications · Analytic Number Theory Research
A note on a recent attempt to prove Sendov’s conjecture
N.A. Rather & Suhail Gulzar
Department of Mathematics, University of Kashmir, Srinagar-190006, India
[email protected], [email protected]
Abstract.
Recently G.M. Sofi & S.A. Ahangar [1] made an attempt to prove the Sendov’s conjecture. But unfortunately the proof is not correct. In this note, we discuss the fallacy in the proof.
Sendov’s conjecture says that if all roots of a polynomial lie within the unit disk, then for every root, there exists a critical point at a distance at most one from the root. Since the Gauss-Lucas theorem implies that the critical points of must themselves lie in the unit disk, it seems completely implausible that the conjecture could be false. Yet, at present, it has not been proven for polynomials with real coefficients or for any polynomial whose degree exceeds
Recently G.M. Sofi & S.A. Shabir [1] claimed to have proved Sendov’s conjecture. But unfortunately the proof is not correct. The proof is divided into two cases. In the first case they consider the class of monic polynomial such that The main flaw in the proof lies in this hypothesis. It is easily to observe that if is a monic polynomial then and that equality holds if and only if To see this:
Consider and then
[TABLE]
Now, if then clearly . Suppose that , then also . By the maximum principle, we have that and this implies .
This fact can also be observed by the following [2] generalization of Visser’s inequality [3].
Theorem 1**.**
If be a polynomial of degree then
[TABLE]
This clearly shows that if is a monic polynomial such that then
In the second case of the proof they consider the case and apply Case-I to . Since is no longer a monic polynomial then the application of Case-I to is not valid. Thus this case is also incorrect.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G.M. Shah & S.A. Ahangar, Proof of Sendov’s conjecture, ar Xive: 1903.01850 v 2 [math.GM] 6 Mar 2019
- 2[2] Suhail Gulzar, On estimates for the coefficients of a polynomial, C. R. Acad. Sci. Paris, Ser. I 354 (2016) 357-363.
- 3[3] C. Visser, A simple proof of certain inequalities concerning polynomials, Proc. K. Ned. Akad. Wet. 47 (1945) 276-281.
