English
Related papers

Related papers: Computing the Coefficients for Non-Periodic Highly…

200 papers

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…

Numerical Analysis · Mathematics 2007-05-23 V. Buyarov , J. S. Dehesa , A. Martinez-Finkelshtein , J. Sanchez-Lara

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

Number Theory · Mathematics 2016-11-29 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

We find solutions for a linear deformation of the symmetric three-term recursion relation. The orthogonal polynomials of the first and second kind associated with the deformed relation are obtained. The new density (weight) function is…

Mathematical Physics · Physics 2009-11-07 A. D. Alhaidari

We are concerned with the monic orthogonal polynomials with respect to a singularly perturbed Laguerre-type weight. By using the ladder operator approach, we derive a complicated system of nonlinear second-order difference equations…

Classical Analysis and ODEs · Mathematics 2023-08-21 Chao Min , Yuan Cheng , Yang Chen

Two-term recurrence relations are supplied for indefinite integrals of functions that involve factors of the types ${P_2}^n$, ${P_3}^n$, ${P_4}^n$, ${P_1}^m {Q_1}^n$, $E_1 {P_1}^n$, ${P_1}^m {Q_2}^n$, $E_1 {P_2}^n$, ${P_2}^m {Q_2}^n$,…

Classical Analysis and ODEs · Mathematics 2012-09-19 Detmar Martin Welz

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…

Classical Analysis and ODEs · Mathematics 2007-05-23 Jeffrey S. Geronimo , Hugo Woerdeman

Ordinary orthogonal polynomials are uniquely characterized by the three term recurrence relations up to an overall multiplicative constant. We show that the newly discovered M-indexed orthogonal polynomials satisfy 3+2M term recurrence…

Mathematical Physics · Physics 2015-06-15 Satoru Odake

Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…

General Mathematics · Mathematics 2021-09-10 Roudy El Haddad

The weak convergence of orthogonal polynomials is given under conditions on the asymptotic behaviour of the coefficients in the three-term recurrence relation. The results generalize known results and are applied to several systems of…

Classical Analysis and ODEs · Mathematics 2016-09-06 Walter Van Assche

We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…

Classical Analysis and ODEs · Mathematics 2026-04-30 Alexandre Benoit , Nicolas Brisebarre , Bruno Salvy

We use the Legendre polynomials and the Hermite polynomials as two examples to illustrate a simple and systematic technique on deriving asymptotic formulas for orthogonal polynomials via recurrence relations. Another application of this…

Classical Analysis and ODEs · Mathematics 2011-01-25 X. -S. Wang , R. Wong

We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…

Combinatorics · Mathematics 2014-12-17 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence.…

Number Theory · Mathematics 2018-04-25 Dmitry I. Khomovsky

In recent years, there has been significant progress in the theory of orthogonal polynomials on algebraic curves, particularly on genus 1 surfaces. In this paper, we focus on elliptic orthogonal polynomials and establish several of their…

Mathematical Physics · Physics 2025-06-12 Harini Desiraju , Sampad Lahiry

We give the asymptotic behavior of the ratio of two neighboring multiple orthogonal polynomials under the condition that the recurrence coefficients in the nearest neighbor recurrence relations converge.

Classical Analysis and ODEs · Mathematics 2016-04-04 Walter Van Assche

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Thomas Cluzeau

We investigate the uniform asymptotic of some Sobolev orthogonal polynomials. Three term recurrence relation is given, moreover we give a recurrence relation between the so-called Sobolev orthogonal polynomials and Freud orthogonal…

Classical Analysis and ODEs · Mathematics 2015-02-24 Mohamed Bouali

In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…

Combinatorics · Mathematics 2010-07-19 Emrah Kilic , Eugen J. Ionascu

We list the so-called Askey-scheme of hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation and generating functions of all classes of orthogonal…

Classical Analysis and ODEs · Mathematics 2016-09-06 Roelof Koekoek , René F. Swarttouw

Given a linear recurrence of the form $c_n=a_1c_{n-1}+\cdots+a_j c_{n-j}$, it is well-known that $c_n=\sum_{r}p_r(n)r^n$, where the sum is taken over the set of characteristic roots and each $p_r(n)$ is some polynomial. We give a closed…