Skip to content

Erdős problem 1039

For f(z)=∏i=1n(z−zi)f(z) = \prod_{i=1}^n (z - z_i) with all ∣zi∣≤1|z_i| \le 1, let ρ(f)\rho(f) be the radius of the largest disc contained in {z:∣f(z)∣<1}\{z : |f(z)| < 1\}. Is ρ(f)≫1/n\rho(f) \gg 1/n? The worst case is now known to be Θ(1/n)\Theta(1/n), with the explicit bound ρ(f)≥(log⁡2)/n\rho(f) \ge (\log 2)/n.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:9c299e95f64f9f481776d56e8933ec7c8130b3aa272bbb24dee00cfe51be8b49
Metadata
sha256:5d7df2958f74e132e4f2e7987ea2a4dbfd888d15f9084f10bcc39a91905e44f4
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:82c8f0fae1da2096fde34cef3561bc84c832a9dce8542108bc878c5463fcf78a
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb