arXiv · 2611.13278
On the number of zeros of polyanalytic polynomials
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$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Erik Lundberg, Zvi Rosen, Teng Zhang. 2026-11-09. On the number of zeros of polyanalytic polynomials. https://searcharxiv.com/abs/2611.13278
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.