arXiv:2611.13278v1 Announce Type: new 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$.
Continue to arXiv Mathematics →You are being forwarded in 6s — stay on this page