arXiv subjects
Publications and source records attributed to Olof Rubin.
We describe the asymptotics of Chebyshev polynomials on an analytic Jordan arc in the plane. This gives an affirmative answer to a conjecture of Christiansen-Simon-Zinchenko, based on predictions of Widom from 1969. The proof combines weighted Faber polynomials with extremal signatures, discrete orthogonal polynomials and a Marcinkiewicz-Zygmund sampling inequality, and yields Szeg\H{o}-Widom asymptotics for the Chebyshev polynomials themselves.
We study the behavior of weighted residual polynomials on circular arcs, including weighted Chebyshev polynomials. For weights given by reciprocals of polynomials, we establish Szeg\H{o}-Widom asymptotics. Extending our analysis to less regular weights, we determine the asymptotic behavior of the corresponding weighted Widom factors, generalizing results by Eichinger and Thiran et al. As an application, we derive the asymptotics of Widom factors on certain lemniscatic arcs.
We prove that the $n$th Chebyshev polynomial $T_{n}$ of a piecewise Dini-smooth Jordan curve $\Gamma$ satisfies \[ \lim_{n\to\infty}\frac{\|T_{n}\|_{\Gamma}}{\mathrm{cap}(\Gamma)^n}=1, \] where $\|\cdot\|_\Gamma$ is the supremum norm over $\Gamma$ and $\mathrm{cap}(\Gamma)$ its logarithmic capacity. This extends earlier results for smooth curves to curves with corner singularities, including cusps. The proof makes use of weighted Faber polynomials, which we analyze using a Fourier analytic representation of the standard Faber polynomials due to Pommerenke. We moreover obtain new asymptotic bounds for the norm of Faber polynomials which are sharp if, for instance, all corners have exterior angle greater than $\pi$.
For an analytic function $\phi(z)$ with a Laurent expansion at $\infty$ of the form \begin{equation*} \phi(z)=z+c_{0}+\frac{c_{1}}{z}+\frac{c_{2}}{z^{2}}+\cdots, \end{equation*} the Faber polynomial $F_n$ of degree $n$ associated to $\phi$ is the polynomial part of the Laurent series at $\infty$ of $\phi(z)^n$. We prove that the $n$th Chebyshev polynomial $T_{n,L_r}$ for the equipotential curve $L_r=\{z\in \mathbb{C}:|\phi(z)|=r \}$ converges to $F_n$ as $r\to\infty$. The proof makes use of the fact that zero is the strongly unique best approximation to the monomial $z^n$ on the unit circle by polynomials of degree less than $n$.
We present a survey of central developments in the theory of Chebyshev polynomials, introduced by P.~L.~Chebyshev and later extended to the complex plane by G.~Faber. Our primary focus is their defining extremal property: among all polynomials with a prescribed leading coefficient, they minimize the supremum norm on a given compact set. Although we do not present new results, we provide -- in selected cases -- new proofs of known theorems and compile a collection of open problems.
We investigate Chebyshev polynomials corresponding to Jacobi weights and determine monotonicity properties of their related Widom factors. This complements work by Bernstein from 1930-31 where the asymptotical behavior of the related Chebyshev norms was established. As a part of the proof, we analyze a Bernstein-type inequality for Jacobi polynomials due to Chow et al. Our findings shed new light on the asymptotical uniform bounds of Jacobi polynomials. We also show a relation between weighted Chebyshev polynomials on the unit circle and Jacobi weighted Chebyshev polynomials on [-1,1]. This generalizes work by Lachance et al. In order to complete the picture we provide numerical experiments on the remaining cases that our proof does not cover.
We employ the generalized Remez algorithm, initially suggested by P. T. P. Tang, to perform an experimental study of Chebyshev polynomials in the complex plane. Our focus lies particularly on the examination of their norms and zeros. What sets our study apart is the breadth of examples considered, coupled with the fact that the degrees under investigation are substantially higher than those in previous studies where other methods have been applied. These computations of Chebyshev polynomials of high degrees reveal discernible, repeating patterns, which indicate a typical behavior of Chebyshev polynomials in a general setting. The use of Tang's algorithm allows for computations executed with precision, maintaining accuracy within quantifiable margins of error. Additionally, as a result of our experimental study, we propose what we believe to be a fundamental relationship between Chebyshev and Faber polynomials associated with a compact set.
This article examines the asymptotic behavior of the Widom factors, denoted $\mathcal{W}_n$, for Chebyshev polynomials of finite unions of Jordan arcs. We prove that, in contrast to Widom's proposal, when dealing with a single smooth Jordan arc, $\mathcal{W}_n$ converges to 2 exclusively when the arc is a straight line segment. Our main focus is on analysing polynomial preimages of the interval $[-2,2]$, and we provide a complete description of the asymptotic behavior of $\mathcal{W}_n$ for symmetric star graphs and quadratic preimages of $[-2,2]$. We observe that in the case of star graphs, the Chebyshev polynomials and the polynomials orthogonal with respect to equilibrium measure share the same norm asymptotics, suggesting a potential extension of a conjecture posed by Christiansen, Simon and Zinchenko. Lastly, we propose a possible connection between the $S$-property and Widom factors converging to $2$.
We consider weighted Chebyshev polynomials on the unit circle corresponding to a weight of the form $(z-1)^s$ where $s>0$. For integer values of $s$ this corresponds to prescribing a zero of the polynomial on the boundary. As such, we extend findings of Lachance, Saff and Varga, to non-integer $s$. Using this generalisation, we are able to relate Chebyshev polynomials on lemniscates and other, more established, categories of Chebyshev polynomials. An essential part of our proof involves the broadening of the Erd\H{o}s--Lax inequality to encompass powers of polynomials. We believe that this particular result holds significance in its own right.