On the valence of logharmonic polynomials
Dmitry Khavinson, Erik Lundberg, Sean Perry
TL;DR
The paper examines Hengartner's valence problem for logharmonic polynomials $f(z)=p(z)\overline{q(z)}$ with $\deg p=n$, $\deg q=m$ and $p\nparallel q$, delivering two central advances. First, for the case $m=1$, it uses an anti-holomorphic dynamics framework and a generalized argument principle to prove a sharp upper bound of $3n-1$ on the valence, confirming a conjecture of Bshouty and Hengartner. Second, it provides a general, algebraic upper bound of $n^2+m^2$ on the valence for all $n,m \ge 1$ via Sylvester resultants, improving the Bezout bound $(n+m)^2$, and extends to polyanalytic polynomials under a nondegeneracy condition by establishing coprimality of the associated polynomials. The work integrates dynamics, harmonic mappings, and algebraic elimination to tighten universal bounds on finite valence, with numerical results supporting sharpness in low-degree cases and potential relevance to gravitational lensing models. Overall, the paper advances the understanding of extremal valence in polyanalytic settings and provides tools that could influence related problems in complex analysis and applied lensing theory.
Abstract
Investigating a problem posed by W. Hengartner (2000), we study the maximal valence (number of preimages of a prescribed point in the complex plane) of logharmonic polynomials, i.e., complex functions that take the form $f(z) = p(z) \overline{q(z)}$ of a product of an analytic polynomial $p(z)$ of degree $n$ and the complex conjugate of another analytic polynomial $q(z)$ of degree $m$. In the case $m=1$, we adapt an indirect technique utilizing anti-holomorphic dynamics to show that the valence is at most $3n-1$. This confirms a conjecture of Bshouty and Hengartner (2000). Using a purely algebraic method based on Sylvester resultants, we also prove a general upper bound for the valence showing that for each $n,m \geq 1$ the valence is at most $n^2+m^2$. This improves, for every choice of $n,m \geq 1$, the previously established upper bound $(n+m)^2$ based on Bezout's theorem. We also consider the more general setting of polyanalytic polynomials where we show that this latter result can be extended under a nondegeneracy assumption.
