2000 character limit reached
A sufficient condition for a complex polynomial to have only simple zeros and an analog of Hutchinson's theorem for real polynomials
Published 17 Jul 2022 in math.CV and math.CA | (2207.08108v1)
Abstract: We find the constant $b_{\infty}$ ($b_{\infty} \approx 4.81058280$) such that if a complex polynomial or entire function $f(z) = \sum_{k=0}^ \omega a_k zk, $ $\omega \in {2, 3, 4, \ldots } \cup {\infty},$ with nonzero coefficients satisfy the conditions $\left|\frac{a_k2}{a_{k-1} a_{k+1}}\right| >b_{\infty} $ for all $k =1, 2, \ldots, \omega-1,$ then all the zeros of $f$ are simple. We show that the constant $b_{\infty}$ in the statement above is the smallest possible. We also obtain an analog of Hutchinson's theorem for polynomials or entire functions with real nonzero coefficients.
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.