2000 character limit reached
A result related to the Sendov conjecture (2309.07142v1)
Published 5 Sep 2023 in math.CV
Abstract: The Sendov conjecture asserts that if $p(z) = \prod_{j=1}{N}(z-z_j)$ is a polynomial with zeros $|z_j| \leq 1$, then each disk $|z-z_j| \leq 1$ contains a zero of $p'$. Our purpose is the following: Given a zero $z_j$ of order $n \geq 2$, determine whether there exists $\zeta \not= z_j$ such that $p'(\zeta) = 0$ and $|z_j - \zeta| \leq 1$. In this paper we present some partial results on the problem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.