We study the two sequences of polynomials which arise as denominators of the approximants of even and odd order, respectively, of a Stieltjes fraction, and which may be defined alternatively as a sequence of orthogonal polynomials with positive zeros and the associated sequence of kernel polynomials. Motivated by problems in the setting of birth-death processes, where these sequences play a maj...

We generalize to Hilbert modular varieties of arbitrary dimension the work of W. Duke [14] on the equidistribution of Heegner points and of primitive positively oriented closed geodesics in the Poincaré upper half plane, subject to certain subconvexity results. We also prove vanishing results for limits of cuspidal Weyl sums associated with analogous problems for the Siegel upper half space of ...

Abstract Using the theory of exponential Riordan arrays and orthogonal polynomials, we demonstrate that the general Eulerian polynomials, as defined by Xiong, Tsao and Hall, are moment sequences for simple families of orthogonal polynomials, which we characterize in terms of their three-term recurrence. We obtain the generating functions of this polynomial sequence in terms of continued fractio...

We study a class of Padovan-like sequences that can be generated using special matrices of the third order. We show that terms of any sequence of this class can be expressed via Bell polynomials and their derivatives that use as arguments terms of another such sequence with smaller indexes. CAS Mathematica is used for cumbersome calculations and hypothesis testing.

We introduce the sequence of generalized Gončarov polynomials, which is a basis for the solutions to the Gončarov interpolation problem with respect to a delta operator. Explicitly, a generalized Gončarov basis is a sequence (tn(x))n≥0 of polynomials defined by the biorthogonality relation εzi(d (tn(x))) = n!δi,n for all i, n ∈ N, where d is a delta operator, Z = (zi)i≥0 a sequence of scalars, ...

X iv :0 90 5. 25 57 v2 [ m at h. R T ] 1 0 Ju n 20 09 JACOBI–TRUDY FORMULA FOR GENERALISED SCHUR POLYNOMIALS A.N. SERGEEV AND A.P. VESELOV Abstract. Jacobi–Trudy formula for a generalisation of Schur polynomials related to any sequence of orthogonal polynomials in one variable is given. As a corollary we have Giambelli formula for generalised Schur polynomials.

In this paper we study ultraflat sequences (Pn) of unimodular polynomials Pn ∈ Kn in general, not necessarily those produced by Kahane in his paper [Ka]. We examine how far is a sequence (Pn) of unimodular polynomials Pn ∈ Kn from being conjugate reciprocal. Our main results include the following. Theorem. Given a sequence (εn) of positive numbers tending to 0, assume that (Pn) is a (εn)-ultraf...

Recently the creation matrix, intimately related to the Pascal matrix and its generalizations, has been used to develop matrix representations of special polynomials, in particular Appell polynomials. In this paper we describe a matrix approach to polynomials in several hypercomplex variables based on special block matrices whose structures simulate the creation matrix and the Pascal matrix. We...

In 1951, F. Brafman derived several “unusual” generating functions of classical orthogonal polynomials, in particular, of Legendre polynomials Pn(x). His result was a consequence of Bailey’s identity for a special case of Appell’s hypergeometric function of the fourth type. In this paper, we present a generalization of Bailey’s identity and its implication to generating functions of Legendre po...