Many lemniscates with large diameter
Abstract
We prove that for every 0 < c < 4 and every N ∈ N there exists a monic polynomial p(z) = zn + an-1 zn-1 + … + a0 such that the set \z ∈ C : |p(z)| ≤ 1\ has at least N connected components with diameter at least c. This answers a question of Erdos.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.