Expansions of one density via polynomials orthogonal with respect to the other

We expand the Chebyshev polynomials and some of its linear combination in linear combinations of the q-Hermite, the Rogers (q-utraspherical) and the Al-Salam-Chihara polynomials and vice versa. We use these expansions to obtain expansions of some densities, including q-Normal and some related to it, in infinite series constructed of the products of the other density times polynomials orthogonal to it, allowing deeper analysis and discovering new properties. On the way we find an easy proof of expansion of the Poisson-Mehler kernel as well as its reciprocal. We also formulate simple rule relating one set of orthogonal polynomials to the other given the properties of the ratio of the respective densities of measures orthogonalizing these polynomials sets.     

On modified Chebyshev polynomials

Two elegant representations are derived for the modified Chebyshev polynomials discussed by Witula and Slota [R. Witula, D. Slota, On modified Chebyshev polynomials, J. Math. Anal. Appl. 324 (2006) 321-343].     

Two-dimensional Fuchsian systems and the Chebyshev property

Let (x(t),y(t))^? be a solution of a Fuchsian system of order two with three singular points. The vector space of functions of the form P(t)x(t)+Q(t)y(t), where P,Q are real polynomials, has a natural filtration of vector spaces, according to the asymptotic behavior of the functions at infinity. We describe a two-parameter class of Fuchsian systems, for which the corresponding vector spaces obey the Chebyshev property (the maximal number of isolated zeros of each function is less than the dimension of the vector space). Up to now, only a few particular systems were known to possess such a non-oscillation property. It is remarkable that most of these systems are of the type studied in the present paper. We apply our results in estimating the number of limit cycles that appear after small polynomial perturbations of several quadratic or cubic Hamiltonian systems in the plane.     

Estimates of the trace of the inverse of a symmetric matrix using the modified Chebyshev algorithm

In this paper we study how to compute an estimate of the trace of the inverse of a symmetric matrix by using Gauss quadrature and the modified Chebyshev algorithm. As auxiliary polynomials we use the shifted Chebyshev polynomials. Since this can be too costly in computer storage for large matrices we also propose to compute the modified moments with a stochastic approach due to Hutchinson (Commun Stat Simul 18:1059–1076, 1989). In memory of Gene H. Golub.     

Higher-order matching polynomials and d-orthogonality

We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the higher-order matching polynomial corresponds to coverings by paths. Several families of classical orthogonal polynomials—the Chebyshev, Hermite, and Laguerre polynomials—can be interpreted as matching polynomials of paths, cycles, complete graphs, and complete bipartite graphs. The notion of d-orthogonality is a generalization of the usual idea of orthogonality for polynomials and we use sign-reversing involutions to show that the higher-order Chebyshev (first and second kinds), Hermite, and Laguerre polynomials are d-orthogonal. We also investigate the moments and find generating functions of those polynomials.     

A note on the modified q-Bernstein polynomials for functions of several variables and their reflections on q-Volkenborn integration

In this paper, we consider the modified q-Bernstein polynomials for functions of several variables on q-Volkenborn integral and investigate some new interesting properties of these polynomials related to q-Stirling numbers, Hermite polynomials and Carlitz’s type q-Bernoulli numbers.     

Permutation polynomials over algebraic number fields

Let K be an algebraic number field. It is known that any polynomial which induces a permutation on infinitely many residue class fields of K is a composition of cyclic and Chebyshev polynomials. This paper deals with the problem of deciding, for a given K, which compositions of cyclic or Chebyshev polynomials have this property. The problem is reduced to the case where K is an Abelian extension of $\text{Q}$. Then the question is settled for polynomials of prime degree, and the Abelian case for composite degree polynomials is considered. Finally, various special cases are dealt with.     

Random Block Matrices and Matrix Orthogonal Polynomials

In this paper we consider random block matrices, which generalize the general beta ensembles recently investigated by Dumitriu and Edelmann (J. Math. Phys. 43:5830–5847, 2002; Ann. Inst. Poincaré Probab. Stat. 41:1083–1099, 2005). We demonstrate that the eigenvalues of these random matrices can be uniformly approximated by roots of matrix orthogonal polynomials which were investigated independently from the random matrix literature. As a consequence, we derive the asymptotic spectral distribution of these matrices. The limit distribution has a density which can be represented as the trace of an integral of densities of matrix measures corresponding to the Chebyshev matrix polynomials of the first kind. Our results establish a new relation between the theory of random block matrices and the field of matrix orthogonal polynomials, which have not been explored so far in the literature.     

Padé-type approximants with orthogonal generating polynomials

The interpolation of the function x → 1/(1 ? xt) generating the series f(t) = ∑^∞_{i = 0}c_itⁱ at the zeros of an orthogonal polynomial with respect to a distribution d α satisfying some conditions will give us a process for accelerating the convergence of f_n(t) = ∑ⁿ_{i = 0}c_itⁱ. Then, we shall see that the polynomial of best approximation of x → 1/(1 ? xt) over some interval or its development in Chebyshev polynomials T_n or U_n are only particular cases of the main theorem.At last, we shall show that all these processes accelerate linear combinations with positive coefficients of totally monotonic and oscillating sequences.     

A family of p-adic twisted interpolation functions associated with the modified Bernoulli numbers

The main purpose of this paper is to construct a family of modified p-adic twisted functions, which interpolate the modified twisted q-Bernoulli polynomials and the generalized twisted q-Bernoulli numbers at negative integers. We also give some applications and examples related to these functions and numbers.     

Chebychev polynomials in a speech recognition model

Advanced speech information processing systems require further research on speaker-dependent information. Recently, a specific system of discrete orthogonal polynomials {φ^L_r(l); l = 1, 2, …, L} ^R_r=0 has been encountered to play a dominant role in a segmental probability model recently proposed in the speaker-dependent feature extraction from speech waves and applied to text-independent speaker verification. Here, these speech polynomials are shown to be the shifted Chebyshev polynomials on a discrete variable t_r(l − 1, L), whose structural and spectral properties are discussed and reviewed in light of the recent discoveries in the field of discrete orthogonal polynomials.     

On the distribution of simple zeros of polynomials

Erd s and Turán discussed in (Ann. of Math. 41 (1940), 162–173; 51 (1950), 105–119) the distribution of the zeros of monic polynomials if their Chebyshev norm on [−1, 1] or on the unit disk is known. We sharpen this result to the case that all zeros of the polynomials are simple. As applications, estimates for the distribution of the zeros of orthogonal polynomials and the distribution of the alternation points in Chebyshev polynomial approximation are given. This last result sharpens a well-known error bound of Kadec (Amer. Math. Soc. Transl. 26 (1963), 231–234).     

Families of orthogonal Laurent polynomials,hyperelliptic lie algebras and elliptic integrals

We describe a family of polynomials discovered via a particular recursion relation, which have connections to Chebyshev polynomials of the first and the second kind, and the polynomial version of Pell's equation. Many of their properties are listed in Section 3. We show that these families of polynomials in the variable t satisfy certain second-order linear differential equations that may be of interest to mathematicians in conformal field theory and number theory. We also prove that these families of polynomials in the setting of Date–Jimbo–Kashiwara–Miwa algebras when multiplied by a suitable power of t are orthogonal with respect to explicitly described kernels. Particular cases lead to new identities of elliptic integrals (see Section 5).     

Galois groups of polynomials arising from circulant matrices

Circulant matrices are used to construct polynomials, associated with Chebyshev polynomials of the first kind, whose roots are real and made explicit. Then the Galois groups of the polynomials are computed, giving rise to new examples of polynomials with cyclic Galois groups and Galois groups of order p(p−1) that are generated by a cycle of length p and a cycle of length p−1.     

Some new perspectives in best approximation and interpolation of random data

A new notion of universally optimal experimental design is introduced, relevant from the perspective of adaptive nonparametric estimation. It is demonstrated that both discrete and continuous Chebyshev designs are universally optimal in the problem of fitting properly weighted algebraic polynomials to random data. The result is a direct consequence of the well-known relation between Chebyshev’s polynomials and the trigonometric functions. Optimal interpolating designs in rational regression proved particularly elusive in the past. The question can be effectively handled using its connection to elliptic interpolation, in which the ordinary circular sinus, appearing in the classical trigonometric interpolation, is replaced by the Abel-Jacobi elliptic sinus sn(x, k) of a modulus k. First, it is demonstrated that — in a natural setting of equidistant design — the elliptic interpolant is never optimal in the so-called normal case k ∈ (?1, 1), except for the trigonometric case k = 0. However, the equidistant elliptic interpolation is always optimal in the imaginary case k ∈ i?. Through a relation between elliptic and rational functions, the result leads to a long sought optimal design, for properly weighted rational interpolants. Both the poles and nodes of the interpolants can be conveniently expressed in terms of classical Jacobi’s theta functions.     

Proximinality in Banach spaces

In this paper, we study approximatively τ-compact and τ-strongly Chebyshev sets, where τ is the norm or the weak topology. We show that the metric projection onto τ-strongly Chebyshev sets are norm-τ continuous. We characterize approximatively τ-compact and τ-strongly Chebyshev hyperplanes and use them to characterize factor reflexive proximinal subspaces in τ-almost locally uniformly rotund spaces. We also prove some stability results on approximatively τ-compact and τ-strongly Chebyshev subspaces.     

Ruin Probabilities for Risk Models with Ordered Claim Arrivals

Recently, Lefèvre and Picard (Insur Math Econ 49:512–519, 2011) revisited a non-standard risk model defined on a fixed time interval [0,t]. The key assumption is that, if n claims occur during [0,t], their arrival times are distributed as the order statistics of n i.i.d. random variables with distribution function F _t (s), 0?≤?s?≤?t. The present paper is concerned with two particular cases of that model, namely when F _t (s) is of linear form (as for a (mixed) Poisson process), or of exponential form (as for a linear birth process with immigration or a linear death-counting process). Our main purpose is to obtain, in these cases, an expression for the non-ruin probabilities over [0,t]. This is done by exploiting properties of an underlying family of Appell polynomials. The ultimate non-ruin probabilities are then derived as a limit.     

Special linear combinations of orthogonal polynomials

The paper lists a number of problems that motivate consideration of special linear combinations of polynomials, orthogonal with the weight p(x) on the interval (a,b). We study properties of the polynomials, as well as the necessary and sufficient conditions for their orthogonality. The special linear combinations of Chebyshev orthogonal polynomials of four kinds with absolutely constant coefficients hold a distinguished place in the class of such linear combinations.