Paperlane

no. 13 · Wednesday 11 November 2026

On the number of zeros of polyanalytic polynomials

Erik Lundberg, Zvi Rosen and Teng Zhang

math.CV · 13 pp

Abstract

We prove that a complex polynomial $f(z,\bar z)$ of degree $n$ in $z$ and degree $m<n$ in $\bar{z}$, with finitely many zeros, has at most $(4m+1)n-5m$ distinct zeros in $\mathbb{C}$. The proof uses an approach suggested by GPT-6.1 based on a topological result of Kronheimer and Mrowka (Thom's Conjecture). We provide examples showing that the bound is asymptotically sharp as $n\to\infty$ for each fixed $m$.

comments
13 pages, 1 figure
fields
Complex Variables, Algebraic Geometry
pdf ↗ page arXiv:2611.13278 ↗