Related papers: Szeg\"o's Theorem and its Probabilistic Descendant…
We present a complete theory of the asymptotics of the zeros of OPUC with Verblunsky coefficients $\alpha_n = \sum_{\ell=1}^L C_\ell b_\ell^n + O((b\Delta)^n)$ where $\Delta <1$ and $\abs{b_\ell} = b<1$.
We study the monic orthogonal polynomials with respect to a singularly perturbed Airy weight. By using Chen and Ismail's ladder operator approach, we derive a discrete system satisfied by the recurrence coefficients for the orthogonal…
We study random exponential sums of the form $\sum_{k=1}^nX_k\times\ex p\{i(\lambda_k^{(1)}t_1+...+\lambda_k^{(s)}t_s)\}$, where $\{X_n\}$ is a sequence of random variables and $\{\lambda_n^{(i)}:1\leq i\leq s\}$ are sequences of real…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
Zernike polynomials are commonly used to represent the wavefront phase on circular optical apertures, since they form a complete and orthonormal basis on the unit disk. In [Diaz et all, 2014] we introduced a new Zernike basis for elliptic…
We establish versions of Szeg\H{o}'s distance formula and Widom's theorem on invertibility of (a family of) Toeplitz operators in a class of finite codimension subalgebras of uniform algebras, obtained by imposing a finite number of linear…
In the first five sections, we deal with the class of probability measures with asymptotically periodic Verblunsky coefficients of p-type bounded variation. The goal is to investigate the perturbation of the Verblunsky coefficients when we…
We prove an ergodic theorem for the rotation number of the composition of a sequence os stationary random homeomorphisms in $S^{1}$. In particular, the concept of rotation number of a matrix $g\in Gl^{+}(2,{\R})$ can be generalized to a…
In this article explicit formulas for the recurrence equation p_{n+1}(x) = (A_n x + B_n) p_n(x) - C_n p_{n-1}(x) and the derivative rules sigma(x) p'_n(x) = alpha_n p_{n+1}(x) + beta_n p_n(x) + gamma_n p_{n-1}(x) and sigma(x) p'_n(x) =…
We consider orthogonal polynomials on the unit circle associated with certain semi-classical weight functions. This means that the Pearson-type differential equations satisfied by these weight functions involve two polynomials of degree at…
We use some properties of orthogonal polynomials to provide a class of upper/lower variance bounds for a function $g(X)$ of an absolutely continuous random variable $X$, in terms of the derivatives of $g$ up to some order. The new bounds…
We show that a compact representation of a semisimple Lie group has an orthogonal decomposition into finite length representations. This generalises and simplifies a number of more special spectral theorems in the literature. We apply it to…
Let $m \geq 2$, let $P(x) \in \mathbb{C}[x]$ have simple roots, and let $A = \mathbb{C}[x^{\pm 1},\,u \mid u^m = P(x)]$ be the coordinate ring of the associated superelliptic curve. The derivation algebra $\mathrm{Der}(A)$ and the current…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…
Given a finite sequence of events and a well-defined notion of events being interesting, the Odds-theorem (Bruss (2000)) gives an online strategy to stop on the last interesting event. It is optimal for independent events. Here we study…
In 2015 the Open Science Collaboration (OSC) (Nosek et al 2015) published a highly influential paper which claimed that a large fraction of published results in the psychological sciences were not reproducible. In this article we review…
We study mesoscopic fluctuations of orthogonal polynomial ensembles on the unit circle. We show that asymptotics of such fluctuations are stable under decaying perturbations of the recurrence coefficients, where the appropriate decay rate…
The theory of equidistribution is about hundred years old, and has been developed primarily by number theorists and theoretical computer scientists. A motivated uninitiated peer could encounter difficulties perusing the literature, due to…
Thiran and Detaille give an explicit formula for the asymptotics of the sup-norm of the Chebyshev polynomials on a circular arc. We give the so-called $\textrm{Szeg\H o}$-Widom asymptotics for this domain, i.e., explicit expressions for the…