Sharp bounds for the valence of certain logharmonic polynomials
Kirill Lazebnik, Erik Lundberg

TL;DR
This paper proves that the maximum valence of certain logharmonic polynomials with a linear factor is exactly 3n-1, confirming a conjecture and completing the understanding of their valence bounds.
Contribution
It establishes the sharpness of the upper bound for the valence of logharmonic polynomials with a linear factor, resolving a conjecture in the field.
Findings
The valence bound of 3n-1 is sharp for these polynomials.
The result confirms the conjecture of Bshouty and Hengartner.
It completes the characterization of valence bounds for this class of polynomials.
Abstract
Consider a logharmonic polynomial; that is, a product of the form , where , are holomorphic polynomials. Assume is linear and denote by the degree of . It was recently shown in arXiv:2302.04339 [math.CV] that the valence of such a logharmonic polynomial is at most ; in this paper we show that their upper bound is sharp. Together with the work of arXiv:2302.04339 [math.CV], this resolves a conjecture of Bshouty and Hengartner.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
