Skip to content

Erdős problem 1044

Let f(z)=∏i=1n(z−zi)∈C[x]f(z)=\prod_{i=1}^n(z-z_i)\in\mathbb{C}[x] where ∣zi∣≤1\lvert z_i\rvert\leq 1 for all ii. If Λ(f)\Lambda(f) is the maximum of the lengths of the boundaries of the connected components of {z:∣f(z)∣<1} \{ z: \lvert f(z)\rvert<1\} then determine the infimum of Λ(f)\Lambda(f).

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:8bb7f9550a77d19b193c464b79b9fd30e0c6d5a76074bb1861ea64a55e84ff99
Metadata
sha256:dea7c2fe76e2227278ea85e7079b2ed6ee0c6147c0d8b5a54019b443940ea8a7
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:183ba159d46cbeb61da3bfd9c4c6e4312d9037d91d0082308032145102889bda
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb