Skip to content

Erdős problem 115

If p(z)p(z) is a polynomial of degree nn such that {z:p(z)1}\{z : \lvert p(z)\rvert\leq 1\} is connected then is it true that maxzCp(z)1p(z)(12+o(1))n2?\max_{\substack{z\in\mathbb{C}\\ \lvert p(z)\rvert\leq 1}} \lvert p'(z)\rvert \leq (\tfrac{1}{2}+o(1))n^2?

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:a816f629e14d5724c4c5983fdc37c2cf89a91281a83137dda170c2f117faa440
Metadata
sha256:77a3b315132dc1bf3faa7bb02d6fd53f725bb41f5422e9d5e9c6b680bbb444e3
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:8c25f71397b223e6065b2a22253722f22aac2fa068f5682cbb1c5f044c84f10b
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page