Erdős problem 1044
Let where for all . If is the maximum of the lengths of the boundaries of the connected components of then determine the infimum of .
Sources
FormalConjectures/ErdosProblems/
1044.lean
Retained formal statement
Tang also suggests that, if the degree is fixed, then the infimum over all such of degree is attained by .
∀ (n : ℕ), 0 < n → IsLeast {L | ∃ f, Erdos1044.IsAdmissible f ∧ f.natDegree = n ∧ Erdos1044.maxBoundaryLength f = L} (Erdos1044.maxBoundaryLength (Polynomial.X ^ n - 1))OpenStatement only, no proof