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.
Osgood and Edson H
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CV 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polynomial approximation avoiding values in countable sets
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.