相关论文: Block orthogonal polynomials: I. Definition and pr…
We study probability measures on the unit circle corresponding to orthogonal polynomials whose sequence of Verblunsky coefficients is invariant under the Fibonacci substitution. We focus in particular on the fractal properties of the…
We survey some recent developments in the theory of orthogonal polynomials defined by differential equations. The key finding is that there exist orthogonal polynomials defined by 2nd order differential equations that fall outside the…
We establish an analogue of the Bochner theorem for first order operators of Dunkl type, that is we classify all such operators having polynomial solutions. Under natural conditions it is seen that the only families of orthogonal…
A set of exactly computable orthonormal basis functions that are useful in computations involving constituent quarks is presented. These basis functions are distinguished by the property that they fall off algebraically in momentum space…
A set of orthogonal polynomials on the unit disk $B(0,1)$ known as Zernike polynomials are commonly used in the analysis and evaluation of optical systems. Here Zernike polynomials are used to construct wavelets for polynomial subspaces of…
In the present paper we derive complicated families of orthogonal polynomials in one variable from scratch using the known ones as building blocks. We recall the basics of operational formalism and introduce the notations we use throughout…
Notions of the orthogonality and convolution orthogonality are explored with the use of the Kontorovich-Lebedev transform and its convolution. New classes of the corresponding orthogonal polynomials and functions are investigated. Integral…
For a block B of a finite group G there are well-known orthogonality relations for the generalized decomposition numbers. We refine these relations by expressing the generalized decomposition numbers with respect to an integral basis of a…
We study the umbral "classical" orthogonal polynomials with respect to a generalized derivative operator $\cal D$ which acts on monomials as ${\cal D} x^n = \mu_n x^{n-1}$ with some coefficients $\mu_n$. Let $P_n(x)$ be a set of orthogonal…
Szego's procedure to connect orthogonal polynomials on the unit circle and orthogonal polynomials on [-1,1] is generalized to nonsymmetric measures. It generates the so-called semi-orthogonal functions on the linear space of Laurent…
It is well known that the family of Hahn polynomials $\{h_n^{\alpha,\beta}(x;N)\}_{n\ge 0}$ is orthogonal with respect to a certain weight function up to $N$. In this paper we present a factorization for Hahn polynomials for a degree higher…
Laurent polynomials related to the Hahn-Exton $q$-Bessel function, which are $q$-analogues of the Lommel polynomials, have been introduced by Koelink and Swarttouw. The explicit strong moment functional with respect to which the Laurent…
The aim of this paper is twofold. The first part is concerned with the associated and the so-called co-polynomials, i.e. new sequences obtained when finite perturbations of the recurrence coefficients are considered. In the second part we…
Orthogonal polynomials have very useful properties in the solution of mathematical problems, so recent years have seen a great deal in the field of approximation theory using orthogonal polynomials. In this paper, we characterize the…
We give several new formulas which are useful for Schubert Calculus associated with the orthogonal groups and related orthogonal degeneracy loci.
Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is…
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…
The spectral measure for the two families of orthogonal polynomial systems related to periodic chains with N-particle elementary unit and nearest neighbour harmonic interaction is computed using two different methods. The interest is in the…
The numerical construction of polynomials in the product representation (as used for instance in variants of the multiboson technique) can become problematic if rounding errors induce an imprecise or even unstable evaluation of the…
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…