pith. sign in

On the zero-free polynomial approximation problem

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Let $E$ be a compact set in $\mathbb C$ with connected complement, and let $A(E)$ be the class of all complex continuous function on $E$ that are analytic in the interior $E^0$ of $E$. Let $f \in A(E)$ be zero free on $E^0$. By Mergelyan's theorem $f$ can be uniformly approximated on $E$ by polynomials, but is it possible to realize such approximation by polynomials that are zero-free on $E$? This natural question has been proposed by J. Andersson and P. Gauthier. So far it has been settled for some particular sets $E$. The present paper describes classes of functions for which zero free approximation is possible on an arbitrary $E$.

fields

math.CV 1

years

2019 1

verdicts

UNVERDICTED 1

representative citing papers

Polynomial approximation avoiding values in countable sets

math.CV · 2019-06-29 · unverdicted · novelty 6.0

Generalizes Lavrentiev's and Mergelyan's theorems to uniform polynomial approximation that avoids any prescribed countable set of values on suitable compact sets in the complex plane.

citing papers explorer

Showing 1 of 1 citing paper.

  • Polynomial approximation avoiding values in countable sets math.CV · 2019-06-29 · unverdicted · none · ref 6 · internal anchor

    Generalizes Lavrentiev's and Mergelyan's theorems to uniform polynomial approximation that avoids any prescribed countable set of values on suitable compact sets in the complex plane.