首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Chebyshev constants and the inheritance problem
Authors:Vilmos Totik  
Institution:aBolyai Institute, Analysis Research Group of the Hungarian Academy of Sciences, University of Szeged, Szeged, Aradi v. tere 1, 6720, Hungary;bDepartment of Mathematics, University of South Florida, 4202 E. Fowler Ave, PHY 114, Tampa, FL 33620-5700, USA
Abstract:It is proven that any set E consisting of finitely many intervals can be approximated with order 1/n by polynomial inverse images of -1,1]. This leads to a new proof of the fact that the n-th Chebyshev constant is less-than-or-equals, slantKcap(E)n with some K independent of n. The proof uses properties of monotone systems, in particular, the statement in the so-called inheritance problem.
Keywords:Chebyshev constants  Sets of finitely many intervals  Logarithmic capacity  Inheritance problem
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号