Related papers: Half-Step-Invariant Sets, Admissible Maps, and Cla…
Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…
Every classical orthogonal polynomial system $p_n(x)$ satisfies a three-term recurrence relation of the type \[ p_{n+1}(x)=(A_nx+B_n)p_n(x)-C_np_{n-1}(x)~ (n=0,1,2,\ldots, p_{-1}\equiv 0), \] with $C_nA_nA_{n-1}>0$. Moreover, Favard's…
Moment problems and orthogonal polynomials, both meant in a single real variable, belong to the oldest problems in Classical Analysis. They have been developing for over a century in two parallel, mostly independent streams. During the last…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
For a series of Markov processes we prove stochastic duality relations with duality functions given by orthogonal polynomials. This means that expectations with respect to the original process (which evolves the variable of the orthogonal…
One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…
Stochastic matrices and positive maps in matrix algebras proved to be very important tools for analysing classical and quantum systems. In particular they represent a natural set of transformations for classical and quantum states,…
Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…
The study of several naturally arising "nearest neighbours" random walks benefits from the study of the associated orthogonal polynomials and their orthogonality measure. I consider extensions of this approach to a larger class of random…
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…
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…
This manuscript contains a small portion of the algebraic theory of orthogonal polynomials developed by Maroni and their applicability to the study and characterization of the classical families, namely Hermite, Laguerre, Jacobi, and Bessel…
When the co-recursion and co-dilation in the recurrence relation of certain sequences of orthogonal polynomials are not at the same level, the behaviour of the modified orthogonal polynomials is expected to have different properties…
Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…
This paper is devoted to several new results concerning (standard) octonion polynomials. The first is the determination of the roots of all right scalar multiples of octonion polynomials. The roots of left multiples are also discussed,…
We study orthogonal polynomial systems arising from general pre-Hilbert inner products on polynomial spaces, beyond the classical framework of measures. To each such inner product we associate a canonical Laplacian defined from an abstract…
The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…
In this semi-expository paper we disclose hidden symmetries of a classical nonholonomic kinematic model and try to explain geometric meaning of basic invariants of vector distributions.