Recurrence Coefficients for Orthogonal Polynomials with a Logarithmic Weight Function
Percy Deift, Mateusz Piorkowski
TL;DR
This paper determines the large-$n$ asymptotics of the recurrence coefficients for orthogonal polynomials on $(-1,1)$ with the logarithmic weight $w(x)=\log\left(\frac{2}{1-x}\right)$. Using the nonlinear steepest descent analysis of the Fokas--Its--Kitaev RH problem and a carefully designed comparison to Legendre-type problems, the authors overcome the challenge posed by the edge singularity at $x=+1$ and the zero at $x=-1$ by introducing ${}^\star$RH problems and a Legendre resolvent. The main results are the explicit asymptotics $a_n=\frac{1}{4n^2}-\frac{3}{16n^2\log^2 n}+O(\frac{1}{n^2\log^3 n})$ and $b_n=\frac{1}{2}-\frac{1}{16n^2}-\frac{3}{32n^2\log^2 n}+O(\frac{1}{n^2\log^3 n})$, confirming a special Magnus conjecture case for this weight and extending earlier CD findings to the boundary case $k=1$ with a zero at $-1$. The work highlights a novel mechanism for uniform invertibility via Legendre resolvents and local parametrices, enabling precise control of the logarithmic singularity’s impact on the RH analysis.
Abstract
We prove an asymptotic formula for the recurrence coefficients of orthogonal polynomials with orthogonality measure $\log \bigl(\frac{2}{1-x}\bigr) {\rm d}x$ on $(-1,1)$. The asymptotic formula confirms a special case of a conjecture by Magnus and extends earlier results by Conway and one of the authors. The proof relies on the Riemann-Hilbert method. The main difficulty in applying the method to the problem at hand is the lack of an appropriate local parametrix near the logarithmic singularity at $x = +1$.
