Maximal and inextensible polynomials and the geometry of the spectra of normal operators
Julius Borcea

TL;DR
This paper investigates the maximal zero-distance polynomials within a specific class, challenges recent proofs of Sendov's conjecture, and introduces an operator-theoretic approach linking polynomial critical points to spectra of normal operators.
Contribution
It characterizes 0-maximal polynomials, demonstrates limitations of current proof methods for Sendov's conjecture, and proposes a novel spectral approach using normal operators.
Findings
Identified all 0-maximal polynomials in the class S(n,0)
Showed some inextensible polynomials are not locally maximal for Sendov's conjecture
Linked polynomial critical points to spectra of normal matrices via an operator approach
Abstract
We consider the set S(n,0) of monic complex polynomials of degree having all their zeros in the closed unit disk and vanishing at 0. For we let denote the distance from the origin to the zero set of . We determine all 0-maximal polynomials of degree , that is, all polynomials such that for any . Using a second order variational method we then show that although some of these polynomials are inextensible, they are not necessarily locally maximal for Sendov's conjecture. This invalidates the recently claimed proofs of the conjectures of Sendov and Smale and shows that the method used in these proofs can only lead to (already known) partial results. In the second part of the paper we obtain a characterization of the critical points of a complex polynomial by means of multivariate majorization relations.…
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 Differential Equations and Dynamical Systems · Advanced Topics in Algebra · Algebraic and Geometric Analysis
