Eremenko's conjecture: a bound linear in for the number of zeros of a polynomial of bidegree
A polyanalytic polynomial is a polynomial in a complex variable and its conjugate. Let have degree in and degree in , and suppose the equation has finitely many solutions. Bézout's theorem bounds their number by a quadratic expression in (Khavinson, Lundberg and Perry: under a coprimality assumption). For the sharp bound is (Khavinson and Neumann), linear in . Eremenko conjectured that this is general: for each there are constants , such that the number of solutions is at most . Wilmshurst's more precise conjecture for harmonic polynomials, , had been disproved in 2015.
- Result
- Proved(see note)
- Status
- Candidate (review pending)
- AI contribution
- AI co-developed
- Method
- Argument
- Field
- Complex analysis; valence of harmonic and polyanalytic polynomials
- Posed by
- A. Eremenko, The number of solutions of some non-holomorphic equations, unpublished note, 7 September 2026
- Year posed
- 2026
- Years open
- 0y
- Solved
- 2026-11-09
- Model
- GPT-6.1
- Vendor
- OpenAI
- Collaborators
- Erik Lundberg, Zvi Rosen, Teng Zhang
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 18 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
Theorem 1.1 of arXiv:2611.13278 (Lundberg, Rosen, Zhang): if , has , and has finitely many zeros, then their number is at most . So Eremenko's conjecture holds with , ; for this recovers . Proposition 4.1: for each fixed and all large there are examples with at least zeros, so the leading coefficient is optimal. The exact maximum for stays open, and the examples are not harmonic, so the conjectured bound for harmonic polynomials (Lee, Lerario, Lundberg) is neither proved nor refuted. The proof builds a smooth surface of degree in whose genus is controlled by the number of zeros and applies the Kronheimer-Mrowka theorem (the Thom conjecture).
What the AI did
From the abstract: "The proof uses an approach suggested by GPT-6.1 based on a topological result of Kronheimer and Mrowka (Thom's Conjecture)." From the paper's AI tools disclosure: "The idea to use a topological approach based on the theorem of Kronheimer and Mrowka was suggested in an interaction with GPT-6.1. The model was also used in subsequent discussions to explore and refine the argument and to help create Figure 1. The final proofs were written and checked by the authors." The work was supported by a grant of access to OpenAI models through the ChatGPT for Academic Researchers program.
Verification
Read by this site on 19 November 2026 in the TeX source of arXiv:2611.13278v1 (13 pages): the introduction, Theorem 1.1, the generic-case construction through the immersion lemma, the statement of the sharpness proposition and the AI disclosure. Eremenko's note of 7 September 2026 was opened on his Purdue page: it states the conjecture of a bound linear in for fixed , and the theorem answers it, with the finiteness assumption made explicit. Recomputed here: the genus formula combined with the Kronheimer-Mrowka bound for degree gives exactly , and gives the known sharp . The construction of the surface was read only as far as the immersion lemma and the perturbation argument was not read; neither was refereed. No formal proof. An arXiv search found no competing or earlier claim; expert reaction outside arXiv was not searched for.
Sources
Submitted by MellowGander562 on