Related papers: Negative moments of orthogonal polynomials
The weak convergence of orthogonal polynomials is given under conditions on the asymptotic behaviour of the coefficients in the three-term recurrence relation. The results generalize known results and are applied to several systems of…
In the 1980s, Viennot developed a combinatorial approach to studying mixed moments of orthogonal polynomials using Motzkin paths. Recently, an alternative combinatorial model for these mixed moments based on lecture hall paths was…
Orthogonal polynomials on the unit circle (OPUC for short) are a family of polynomials whose orthogonality is given by integration over the unit circle in the complex plane. There are combinatorial studies on the moments of various types of…
New formulas for the nth moment of the Askey-Wilson polynomials are given. These are derived using analytic techniques, and by considering three combinatorial models for the moments: Motzkin paths, matchings, and staircase tableaux. A…
The theme of this article is a "reciprocity" between bounded up-down paths and bounded alternating sequences. Roughly speaking, this ``reciprocity" manifests itself by the fact that the extension of the sequence of numbers of paths of…
A combinatorial theory for type $R_I$ orthogonal polynomials is given. The ingredients include weighted generalized Motzkin paths, moments, continued fractions, determinants, and histories. Several explicit examples in the Askey scheme are…
We consider positive Jacobi matrices $J$ with compact inverses and consequently with purely discrete spectra. A number of properties of the corresponding sequence of orthogonal polynomials is studied including the convergence of their…
Analogously to de Bruijn sequences, orientable sequences have application in automatic position-location applications and, until recently, studies of these sequences focused on the binary case. In recent work by Alhakim et al., a range of…
We reconsider the problem of calculating arbitrary negative integer moments of the (regularized) characteristic polynomial for $N\times N$ random matrices taken from the Gaussian Unitary Ensemble (GUE). A very compact and convenient…
A {\em Motzkin path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of horizontal-steps $(1, 0)$, up-steps $(1,1)$, and down-steps $(1,-1)$, which never passes…
We study the higher-order Euler polynomials and give the corresponding monic orthogonal polynomials, which are Meixner-Pollaczek polynomials with certain arguments and constant factors. Moreover, through a general connection between moments…
We use the inversion of coefficient arrays to define dual polynomials to the Fibonacci and Catalan-Fibonacci polynomials, and we explore the properties of these new polynomials sequences. Many of the arrays involved are Riordan arrays.…
We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…
We relate the combinatorics of periodic generalized Dyck and Motzkin paths to the cluster coefficients of particles obeying generalized exclusion statistics, and obtain explicit expressions for the counting of paths with a fixed number of…
We prove that the sequence $(1/F_{n+2})_{n\ge 0}$ of reciprocals of the Fibonacci numbers is a moment sequence of a certain discrete probability, and we identify the orthogonal polynomials as little $q$-Jacobi polynomials with…
We introduce an equivalence relation on the set of Dyck paths and some operations on them. We determine a formula for the cardinality of those equivalence classes and use this information to obtain a combinatorial formula for the number of…
This paper presents two alternative approaches for counting the number of two-row weakly increasing matrices, which are $2\times n$ matrices whose entries are integers from $1$ to $k$ and are weakly increasing along all rows and columns,…
In this paper we introduce and discuss some classes of orthogonal polynomials in several non-commuting variables. The emphasis is on a non-commutative version of the orthogonal polynomials on the real line. We introduce recurrence equations…
We suggest three applications for the inverses: For the inverse Motzkin matrix we look at Hankel determinants, and counting the paths inside a horizontal band, and for the inverse Schr\"oder matrix we look at the paths inside the same band,…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…