Related papers: Reproducing kernel orthogonal polynomials on the m…
We provide a robust and general algorithm for computing distribution functions associated to induced orthogonal polynomial measures. We leverage several tools for orthogonal polynomials to provide a spectrally-accurate method for a broad…
We analyze and partially solve system of recurrences that can be derived from the properties of martingale orthogonal polynomials that characterize quadratic harnesses (QH). We also specify conditions for the existence of moments of one…
We establish a direct correspondence between the Lanczos approach and the orthogonal polynomials approach in random matrix theory. In the large-$N$ and continuum limits, the average Lanczos coefficients and the recursion coefficients become…
We derive lower und upper bounds for the degree of regularity of an overdetermined, zero-dimensional and homogeneous quadratic semi-regular system of polynomial equations. The analysis is based on the interpretation of the associated…
Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…
A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…
For a system of two measures supported on a starlike set in the complex plane, we study asymptotic properties of associated multiple orthogonal polynomials $Q_{n}$ and their recurrence coefficients. These measures are assumed to form a…
This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its…
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 introduce Macdonald polynomials indexed by $n$-tuples of partitions and characterized by certain orthogonality and triangularity relations. We prove that they can be explicitly given as products of ordinary Macdonald polynomials…
We consider the problem of simultaneously learning to linearly combine a very large number of kernels and learn a good predictor based on the learnt kernel. When the number of kernels $d$ to be combined is very large, multiple kernel…
We utilize Cauchy's argument principle in combination with the Jacobian of a holomorphic function in several complex variables and the first moment of a ratio of two correlated complex normal random variables to prove explicit formulas for…
We give expansions of reproducing kernels of the Christoffel-Darboux type in terms of Schur polynomials. For this, we use evaluations of averages of characteristic polynomials and Schur polynomials in random matrix ensembles. We explicitly…
Exact eigenvalue correlation functions are computed for large $N$ hermitian one-matrix models with eigenvalues distributed in two symmetric cuts. An asymptotic form for orthogonal polynomials for arbitrary polynomial potentials that support…
We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…
We study the spectrum of inner-product kernel matrices, i.e., $n \times n$ matrices with entries $h (\langle \textbf{x}_i ,\textbf{x}_j \rangle/d)$ where the $( \textbf{x}_i)_{i \leq n}$ are i.i.d.~random covariates in $\mathbb{R}^d$. In…
New bispectral polynomials orthogonal on a quadratic bi-lattice are obtained from a truncation of Wilson polynomials. Recurrence relation and difference equation are provided. The recurrence coefficients can be encoded in a perturbed…
We call Krawtchouk-Griffiths systems, KG-systems, systems of multivariate polynomials orthogonal with respect to corresponding multinomial distributions. The original Krawtchouk polynomials are orthogonal with respect to a binomial…
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…
We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the…