pith. sign in

arxiv: 1501.00247 · v1 · pith:FU6KEOOWnew · submitted 2015-01-01 · 🧮 math.CV

On the zero-free polynomial approximation problem

classification 🧮 math.CV
keywords approximationbeenfreepolynomialspossiblezerozero-freeanalytic
0
0 comments X
read the original 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$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Polynomial approximation avoiding values in countable sets

    math.CV 2019-06 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.