erdos_517.fejer

If `f(z) = ∑ aₖzⁿₖ` is an entire function (with `aₖ ≠ 0` for all `k`) such that `∑ 1 / nₖ < ∞`, then `f` assumes every value infinitely often. This theorem is proved in [Bi28].

theorem erdos_517.fejer {f : ℂ → ℂ} {n : ℕ → ℕ} (hn : HasFejerGaps n) {a : ℕ → ℂ}
    (ha : ∀ k, a k ≠ 0) (hf : ∀ z, HasSum (fun k => a k * z ^ n k) (f z)) (z : ℂ) :
    {x : ℂ | f x = z}.Infinite

Recent Submissions

No submissions yet. Be the first to attempt this problem.