On the number of solutions of some transcendental equations (Q1668693): Difference between revisions

Let \(f(z), z\in\mathbb{C},\) be a polynomial. \textit{D. Khavinson} and \textit{G. Świątek} [Proc. Am. Math. Soc. 131, No. 2, 409--414 (2003; Zbl 1034.30003)] obtained an estimate for the number of solutions of the equation \(\bar z = f (z)\) by a remarkable argument combining topological degree considerations with Fatou's theorem from holomorphic dynamics. Different extensions of this result have been obtained in [the authors, Comput. Methods Funct. Theory 10, No. 1, 303--324 (2010; Zbl 1198.31002); Proc. Am. Math. Soc. 144, No. 7, 2911--2922 (2016; Zbl 1337.31001); \textit{D. Khavinson} and \textit{E. Lundberg}, Anal. Math. Phys. 1, No. 2--3, 139--145 (2011; Zbl 1255.83028); \textit{D. Khavinson} and \textit{G. Neumann}, Proc. Am. Math. Soc. 134, No. 4, 1077--1085 (2006; Zbl 1090.30008)]. The authors write that the present paper is a part of their efforts to understand the scope of applicability of the method. Let \(p\) and \(q\) be coprime polynomials of degrees \(m\) and \(n\), respectively, with at least one of the polynomials non-constant. It is proved that the number \(N\) of solutions of the equation \[ p(z)\log |z| + q(z) = 0 \leqno{(*)} \] satisfies \[ \max\{m, n\} \leq N \leq 3 \max\{m, n\} + 2m. \] The authors write: `The proof of the upper bound combines the computation of a topological degree with Fatou's theorem as in the paper of Khavinson and Świątek [loc.cit.]. The difference of our argument in comparison with previous applications of the method is that we transform \((\ast)\) to an equation with infinitely many solutions, but it is still possible to obtain the desired estimate. The computation of the topological degree also yields the lower bound, but only if solutions are counted with multiplicities. In order to obtain a lower bound for the number of distinct solutions we study the curves where the rational function \(q/p\) is real.' The authors also present examples to show that the estimate is sharp, at least for many values of \(m\) and \(n\).