Work

Polynomial lemniscates meet in at most 2n₁n₂ − 2 points

Year: 2026
Type: preprint
Abstract: Orevkov and Pakovich proved that the lemniscates of two rational functions of degrees n₁ and n₂ meet in at most 2n₁n₂ points when they meet in finitely many, that this is sharp for rational functions, and remarked that it does not seem sharp for polynomials. We prove that two polynomial lemniscates of degrees n₁, n₂ ≥ 2 with finitely many common points have at most 2n₁n₂ − 2 of them, with equality for (n₁, n₂) = (2, 2) and (2, 3). In particular two distinct Cassini ovals, and two lemniscates of Bernoulli, meet in at most six points, which answers Mathematics Stack Exchange question 1250327. The proof treats z and its conjugate as independent variables and evaluates a weighted sum over the 2n₁n₂ complex solutions as −(n₁n₂/2)|c₁ − c₂|² ≤ 0, so either two solutions lie off the real locus or all of them coincide. Every proof is formally verified in Lean 4; the ten points of the (2, 3) example are certified by interval arithmetic. This record is identical to the folder polynomial-lemniscates at tag polynomial-lemniscates-v2 of https://github.com/jvvk/mathematics. Version 2 of the preprint; version 1 (8 October 2026) was released on GitHub only.
Language: English
Open Access status: green
OpenAlex ID: W7236712534
Cites: 1
Cited by:
Related to: 10