English

Maximal and linearly inextensible polynomials

Complex Variables 2007-05-23 v3 Classical Analysis and ODEs

Abstract

Let S(n,0) be the set of monic complex polynomials of degree n2n\ge 2 having all their zeros in the closed unit disk and vanishing at 0. For pS(n,0)p\in S(n,0) denote by p0|p|_{0} the distance from the origin to the zero set of pp'. We determine all 0-maximal polynomials of degree nn, that is, all polynomials pS(n,0)p\in S(n,0) such that p0q0|p|_{0}\ge |q|_{0} for any qS(n,0)q\in S(n,0). Using a second order variational method we then show that although some of these polynomials are linearly inextensible, they are not locally maximal for Sendov's conjecture.

Keywords

Cite

@article{arxiv.math/0601600,
  title  = {Maximal and linearly inextensible polynomials},
  author = {Julius Borcea},
  journal= {arXiv preprint arXiv:math/0601600},
  year   = {2007}
}

Comments

Final version, to appear in Mathematica Scandinavica, 16 pages, no figures, LaTeX2e