Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Let with every . Theorem 4 of Pommerenke, On metric properties of complex polynomials, Michigan Math. J. 8 (1961), no. 2, 97–115 (printed p. 101), states that the set contains a disk of radius ; the proof centers the disk at a zero of and places it in the component of through . Every point of the open disk has , so in the notation of Problem 1039
for every such , and the minimal inradius is at least . The paper introduces the theorem by recalling the question of Erdős, Herzog and Piranian whether $\rho\ge\mathrm{const}\cdot n^{-1}$ when the zeros lie in the closed unit disk, their Problem 3, and says that it proves only a weaker estimate. The proof combines the diameter bound of the paper's Theorem 3 for the component through , hence a capacity above , with the author's derivative bound on that component, and integrates from a zero to the nearest boundary point. The theorem is recorded on the result page Theorem 4 of the card Pommerenke 1961.
Covers. The lower bound . It settles neither the order of nor the second question, whether ; the bound was improved to order on Krishnapur, Lundberg and Ramachandran 2025, and the order is the claim on Price 2026.
Depends on. No page of this wiki: the proof is self-contained in the paper, with the external inputs the result page names.
Acceptance. Refereed: the paper appeared in the Michigan Mathematical
Journal in 1961 (volume 8, issue 2; the issue carries no month, so the page is
dated to the first day of the publication year). The site's commentary
credits the bound to this paper, cited as [Po61], but labels the problem
OPEN, so the remark is not acceptance and no reviewed is listed. Nothing
here rests on this project's own review.