TY - JOUR
T1 - Inverse Polynomial Images are Always Sets of Minimal Logarithmic Capacity
AU - Schiefermayr, Klaus
N1 - Publisher Copyright:
© 2015, Springer-Verlag Berlin Heidelberg.
PY - 2016/9/1
Y1 - 2016/9/1
N2 - In this paper, we prove that each inverse polynomial image (that is, each inverse image of an interval with respect to a polynomial mapping) is a set of minimal logarithmic capacity in a certain sense. Such sets play an important role in the theory of Padé-Approximation. The proofs are all based on the characterization theorems of Herbert Stahl.
AB - In this paper, we prove that each inverse polynomial image (that is, each inverse image of an interval with respect to a polynomial mapping) is a set of minimal logarithmic capacity in a certain sense. Such sets play an important role in the theory of Padé-Approximation. The proofs are all based on the characterization theorems of Herbert Stahl.
KW - Inverse polynomial image
KW - Minimal logarithmic capacity
KW - Symmetry property
UR - http://www.scopus.com/inward/record.url?scp=84982806674&partnerID=8YFLogxK
U2 - 10.1007/s40315-015-0143-x
DO - 10.1007/s40315-015-0143-x
M3 - Article
VL - 16
SP - 375
EP - 386
JO - COMPUTATIONAL METHODS AND FUNCTION THEORY
JF - COMPUTATIONAL METHODS AND FUNCTION THEORY
IS - 3
ER -