Erdős problem 1133
Must every sufficiently large node set admit bounded labels that force any polynomial fitting almost all labels at degree below to have arbitrarily large uniform norm? Claimed via Beurling density for Bernstein spaces.
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/1133.leanTrue ↔ ∀ C > 0, ∃ ε > 0, ∀ᶠ (n : ℕ) in Filter.atTop, ∀ (x : Fin n → ↑(Set.Icc (-1) 1)), ∃ y, ∀ (P : Polynomial ℝ), ↑P.natDegree < (1 + ε) * ↑n → ↑{i | Polynomial.eval (↑(x i)) P = ↑(y i)}.card ≥ (1 - ε) * ↑n → ∃ z ∈ Set.Icc (-1) 1, |Polynomial.eval z P| > COpenStatement only, no proof
Reported activity
Reported by these sources. Not reviewed here.
AI collaborating with humans
- Machine
- People
argument
- Machine
- Reported outcome