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

From MaRDI portal
Publication:6473151

arXivmath/0309233MaRDI QIDQ6473151FDOQ6473151

Julius Borcea

Publication date: 15 September 2003

Abstract: We consider the set S(n,0) of monic complex polynomials of degree nge2 having all their zeros in the closed unit disk and vanishing at 0. For pinS(n,0) we let |p|0 denote the distance from the origin to the zero set of p. We determine all 0-maximal polynomials of degree n, that is, all polynomials pinS(n,0) such that |p|0ge|q|0 for any qinS(n,0). 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. We also propose an operator theoretical approach to Sendov's conjecture, which we formulate in terms of the spectral variation of a normal operator and its compression to the orthogonal complement of a trace vector. Using a theorem of Gauss-Lucas type for normal operators, we relate the problem of locating the critical points of complex polynomials to the more general problem of describing the relationships between the spectra of normal matrices and the spectra of their principal submatrices.












This page was built for publication: Maximal and inextensible polynomials and the geometry of the spectra of normal operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6473151)