Related papers: A Riemann-Hilbert problem for skew-orthogonal poly…

We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of even grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with certain, explicitly…

In this article, we consider the Christoffel transformations for skew-orthogonal polynomials and partial-skew-orthogonal polynomials. We demonstrate that the Christoffel transformations can act as spectral problems for discrete integrable…

The tacnode Riemann-Hilbert problem is a 4 x 4 matrix valued RH problem that appears in the description of the local behavior of two touching groups of non-intersecting Brownian motions. The same RH problem was also found by Duits and…

The computation of the entries of Jacobi operators associated with orthogonal polynomials has important applications in numerical analysis. From truncating the operator to form a Jacobi matrix, one can apply the Golub--Welsh algorithm to…

We consider polynomials orthogonal on $[0,\infty)$ with respect to Laguerre-type weights $w(x)=x^\alpha e^{-Q(x)}$, where $\alpha>-1$ and where $Q$ denotes a polynomial with positive leading coefficient. The main purpose of this paper is to…

In this short lecture, we compute asymptotics of orthogonal polynomials, from a saddle point approximation. This is an example of a calculation which shows the link between integrability, algebraic geometry and random matrices.

Rigorous pointwise asymptotics are established for semiclassical soliton ensembles (SSEs) of the focusing nonlinear Schroedinger equation using techniques of asymptotic analysis of matrix Riemann-Hilbert problems. The accumulation of poles…

We continue studying polynomials generated by the Szeg\H{o} recursion when a finite number of Verblunsky coefficients lie outside the closed unit disk. We prove some asymptotic results for the corresponding orthogonal polynomials and then…

We use discrete analogs of Riemann-Hilbert problem's methods to derive the discrete Bessel kernel which describes the poissonized Plancherel measures for symmetric groups. To do this we define discrete analogs of a Riemann-Hilbert problem…

We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…

Explicit expressions are given for the actions and radial matrix elements of basic radial observables on multi-dimensional spaces in a continuous sequence of orthonormal bases for unitary SU(1,1) irreps. Explicit expressions are also given…

Calogero-Sutherland models associated to the Weyl groups of type A and B with exchange terms included in the Hamiltonians systems have non-symmetric eigenfunctions, which are products of the ground state with members of a family of…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of…

There are some distinguished ensembles of non-Hermitian random matrices for which the joint PDF can be written down explicitly, is unchanged by rotations, and furthermore which have the property that the eigenvalues form a Pfaffian point…

We obtain asymptotics of polynomials satisfying the orthogonality relations $$ \int_{\mathbb{R}} z^k P_n(z; t , N) \mathrm{e}^{-N \left(\frac{1}{4}z^4 + \frac{t}{2}z^2 \right)} \mathrm{d} z = 0 \quad \text{ for } \quad k = 0, 1, ..., n-1,…

We carry out some algebraic and analytic properties of a new class of orthogonal polyanalytic polynomials, including their operational formulas, recurrence relations, generating functions, integral representations and different…

Gradient-based (a.k.a. `first order') optimization algorithms are routinely used to solve large scale non-convex problems. Yet, it is generally hard to predict their effectiveness. In order to gain insight into this question, we revisit the…

Skew polynomials are a class of non-commutative polynomials that have several applications in computer science, coding theory and cryptography. In particular, skew polynomials can be used to construct and decode evaluation codes in several…

This article describes certain ratios that attend pairs of complementary Gauss-Jordan pivotings transforming skew-symmetric matrices. Our interest in those ratios was motivated by a need to prove a crucial Claim stated in a recently…