Claimed Collaborative

A linear bound on zeros of polyanalytic polynomials, via a topological approach suggested by GPT-6.1

Lundberg, Rosen and Zhang prove that a complex polynomial of degree nn in zz and m<nm < n in z‾\bar z with finitely many zeros has at most (4m+1)n−5m(4m+1)n - 5m of them, answering Eremenko's question of whether the count is linear in nn for fixed mm, using an approach through the Kronheimer–Mrowka theorem that GPT-6.1 suggested.

Model
GPT-6.1
Field
Mathematics
Date
2026-11-09
Human collaborators
Erik Lundberg, Zvi Rosen, Teng Zhang

What was found

The problem of bounding the zeros goes back to Sheil-Small, and known bounds for polynomials of this kind were quadratic in nn; Eremenko asked whether, for each fixed mm, the dependence can be made linear, generalizing open questions for particular subclasses. The paper bihomogenizes the polynomial, considers its zero curve, and applies the genus bound of Kronheimer and Mrowka from their proof of Thom's conjecture. It gives examples showing the bound is asymptotically sharp as n→∞n \to \infty for each fixed mm; these examples are not harmonic, so they do not bear on the separate conjecture for harmonic polynomials.

Novelty check

arXiv, 2026-11-19, abs:polyanalytic AND abs:zeros returned 6 records. The closest is Sète and Zur (arXiv:2403.04591, 2024), which proves an n2n^2 bound for polyanalytic polynomials of degree nn with finitely many zeros; the new bound is linear in nn for fixed mm. Nothing in this registry covers zeros of polyanalytic or harmonic polynomials.

Caveats and known objections

A 13-page preprint, unrefereed, with no outside reader on record. The bound is asymptotically, not exactly, sharp. The paper gives no year for Eremenko's problem. The disclosure is specific: the idea of a topological approach based on Kronheimer and Mrowka 'was suggested in an interaction with GPT-6.1', the model then helped explore and refine the argument and make Figure 1, and the final proofs were written and checked by the authors, which could support author verified; it is held at claimed. Autonomy is collaborative: the model supplied the key idea, which reads as ai-led, but the authors developed and wrote the proof with it over subsequent discussions, and the weaker grade wins when arguable.

Also recorded at

vibemathednumber-of-zeros-of-polyanalytic-polynomials

Nothing mechanically. It is a parallel listing of the same result, carrying its own verification label rather than an independent check.

No independent check is recorded on this entry yet.

Reading the primary source closely enough to say whether it supports the claim counts as a check, and you are credited on the entry.

Or on GitHub: submit a check challenge the grade send a correction or send a pull request

Entry history (1 event)
  1. AddedEntered the registry graded Claimed and Collaborative.

Entries are never deleted. A grade that does not hold up is downgraded on the record, with the reason beside it.

Graded claimed for verification and collaborative for autonomy. What these mean.

Cite this entry

Plain text
whataifound.org. (2026). A linear bound on zeros of polyanalytic polynomials, via a topological approach suggested by GPT-6.1. whataifound.org: A Registry of AI Scientific and Mathematical Discoveries. https://whataifound.org/finding/2026-11-09-polyanalytic-zeros-linear-bound
BibTeX
@misc{whataifound-independent-2026-bound,
  title        = {A linear bound on zeros of polyanalytic polynomials, via a topological approach suggested by GPT-6.1},
  author       = {{whataifound.org}},
  year         = {2026},
  howpublished = {whataifound.org: A Registry of AI Scientific and Mathematical Discoveries},
  note         = {Result by Independent. Verification: Claimed. Autonomy: Collaborative.},
  url          = {https://whataifound.org/finding/2026-11-09-polyanalytic-zeros-linear-bound}
}

Related findings

← All mathematics findings in the registry