Maximal and linearly inextensible polynomials

DOI10.7146/MATH.SCAND.A-14999MaRDI QIDQ5444137zbMATH OpenOpenAlexFDO

Authors Julius Borcea

Publication date 22 February 2008

Published in MATHEMATICA SCANDINAVICA (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0601600

zbMATH Keywords

monic complex polynomial

Mathematics Subject Classification ID

Polynomials and rational functions of one complex variable (30C10) Interpolation in approximation theory (41A05)

Abstract: Let S(n,0) be the set of monic complex polynomials of degree $nge2$ having all their zeros in the closed unit disk and vanishing at 0. For $pinS(n,0)$ denote by $|p{|}_0$ the distance from the origin to the zero set of $p^{\prime }$. We determine all 0-maximal polynomials of degree $n$, that is, all polynomials $pinS(n,0)$ such that $|p{|}_{0}ge|q{|}_0$ for any $qinS(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.

Recommendations

• Two approaches to Sendov's conjecture
• scientific article; zbMATH DE number 936905
• Some maximal polynomials must be nonreal
• scientific article; zbMATH DE number 1149993
• Continuous Independence and the Ilieff-Sendov Conjecture

Cited in

(2)

• Maximal points of stable and related polynomials
• Equilibrium points of logarithmic potentials induced by positive charge distributions. I. Generalized de Bruijn-Springer relations

This page was built for publication: Maximal and linearly inextensible polynomials

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