On polynomials orthogonal to all powers of a Chebyshev polynomial on a segment

On the convergence of Chebyshev--Padé approximations to real-valued algebraic functions

We announce some new results on the convergence of Chebyshev--Padé approximations to real-valued algebraic function given on the segment $[-1,1]$. The rate of convergence on the segment and in the corresponding maximal domain of meromorphity of a given function is charactirized in terms of a theoretical potential equilibrium problem.

若尔当弧上的切比雪夫多项式

Chebyshev polynomials on a Jordan arc

该研究描述平面解析若尔当弧上切比雪夫多项式的渐近行为，结合多种多项式与不等式证明，解决相关猜想并得到其Szegő-Widom渐近结果。

On a conjecture of Widom

In 1969 Harold Widom published his seminal paper, which gave a complete description of orthogonal and Chebyshev polynomials on a system of smooth Jordan curves. When there were Jordan arcs present the theory of orthogonal polynomials turned out to be just the same, but for Chebyshev polynomials Widom's approach proved only an upper estimate, which he conjectured to be the correct asymptotic behavior. In this note we make some clarifications which will show that the situation is more complicated.

Small polynomials with integer coefficients

We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials. Their factors, zero distribution and asymptotics are the main subjects of this paper. In particular, we show that the integer Chebyshev polynomials for any infinite subset of the real line must have infinitely many distinct factors, which answers a question of Borwein and Erdélyi. Furthermore, it is proved that the accumulation set for their zeros must be of po…

On Complex (non analytic) Chebyshev Polynomials in $\bbC^2$

We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in $\bbC^2$ by polynomials of lower degree with complex coefficients. We reduce the problem to a one-dimensional weighted minimization problem on an interval. In a sense, the corresponding extremal polynomials are uniform counterparts of the classical orthogonal Jacobi polynomials. They can be represented by means of special conformal mappings on the so-called comb-like domains. In these terms, the value of the minimal deviation and the representation for a polynomial of best approximation…

Asymptotics of Discrete Chebyshev Polynomials

The discrete Chebyshev polynomials $t_n(x,N)$ are orthogonal with respect to a distribution, which is a step function with jumps one unit at the points $x=0,1,\cdots, N-1$, $N$ being a fixed positive integer. By using a double integral representation, we have recently obtained asymptotic expansions for $t_{n}(aN,N+1)$ in the double scaling limit, namely, $N\rightarrow\infty$ and $n/N\rightarrow b$, where $b\in (0,1)$ and $a\in(-\infty,\infty)$; see [Studies in Appl. Math. \textbf{128} (2012), 337-384]. In the present paper, we continue to investigate the behaviour of these polynomials when the…