Maximal and linearly inextensible polynomials
复变函数
2007-05-23 v3 经典分析与常微分方程
摘要
Let S(n,0) be the set of monic complex polynomials of degree having all their zeros in the closed unit disk and vanishing at 0. For denote by 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 linearly inextensible, they are not locally maximal for Sendov's conjecture.
引用
@article{arxiv.math/0601600,
title = {Maximal and linearly inextensible polynomials},
author = {Julius Borcea},
journal= {arXiv preprint arXiv:math/0601600},
year = {2007}
}
备注
Final version, to appear in Mathematica Scandinavica, 16 pages, no figures, LaTeX2e