scholarly journals Sequences of Non-Gegenbauer-Humbert Polynomials Meet the Generalized Gegenbauer-Humbert Polynomials

ISRN Algebra ◽  
2011 ◽  
Vol 2011 ◽  
pp. 1-18 ◽  
Author(s):  
Tian-Xiao He ◽  
Peter J.-S. Shiue
Keyword(s):  
Recurrence Relation ◽  
Recurrence Relations ◽  
Linear Recurrence ◽  
Polynomial Sequences ◽  
Linear Recurrence Relation ◽  
The Relationship ◽  
Humbert Polynomials

Here, we present a connection between a sequence of polynomials generated by a linear recurrence relation of order 2 and sequences of the generalized Gegenbauer-Humbert polynomials. Many new and known transfer formulas between non-Gegenbauer-Humbert polynomials and generalized Gegenbauer-Humbert polynomials are given. The applications of the relationship to the construction of identities of polynomial sequences defined by linear recurrence relations are also discussed.

scholarly journals On Sequences of Numbers and Polynomials Defined by Linear Recurrence Relations of Order 2

2009 ◽  
Vol 2009 ◽  
pp. 1-21 ◽  
Author(s):  
Tian-Xiao He ◽  
Peter J.-S. Shiue
Keyword(s):  
Recurrence Relation ◽  
Chebyshev Polynomials ◽  
Recurrence Relations ◽  
Linear Recurrence ◽  
Lucas Numbers ◽  
Polynomial Sequences ◽  
Fibonacci And Lucas Numbers ◽  
Linear Recurrence Relation ◽  
Humbert Polynomials ◽  
General Method

Here we present a new method to construct the explicit formula of a sequence of numbers and polynomials generated by a linear recurrence relation of order 2. The applications of the method to the Fibonacci and Lucas numbers, Chebyshev polynomials, the generalized Gegenbauer-Humbert polynomials are also discussed. The derived idea provides a general method to construct identities of number or polynomial sequences defined by linear recurrence relations. The applications using the method to solve some algebraic and ordinary differential equations are presented.

scholarly journals Sequences of Numbers Meet the Generalized Gegenbauer-Humbert Polynomials

2011 ◽  
Vol 2011 ◽  
pp. 1-16
Author(s):  
Tian-Xiao He ◽  
Peter J.-S. Shiue ◽  
Tsui-Wei Weng
Keyword(s):  
Recurrence Relation ◽  
Recurrence Relations ◽  
Linear Recurrence ◽  
Linear Recurrence Relation ◽  
The Relationship ◽  
Humbert Polynomials

Here we present a connection between a sequence of numbers generated by a linear recurrence relation of order 2 and sequences of the generalized Gegenbauer-Humbert polynomials. Many new and known formulas of the Fibonacci, the Lucas, the Pell, and the Jacobsthal numbers in terms of the generalized Gegenbauer-Humbert polynomial values are given. The applications of the relationship to the construction of identities of number and polynomial value sequences defined by linear recurrence relations are also discussed.

scholarly journals Simultaneous Linear Recurrence Relations with Variable Coefficients

1958 ◽  
Vol 9 (4) ◽  
pp. 183-206
Author(s):  
H. D. Ursell
Keyword(s):  
Recurrence Relation ◽  
Recurrence Relations ◽  
Standard Form ◽  
Variable Coefficients ◽  
Linear Recurrence ◽  
Integer Variable ◽  
Self Consistent ◽  
Fixed Order ◽  
Image Position ◽  
Linear Recurrence Relation

Our subject is a set of equationswhere the uj(n)(j = 1, 2, …, k) are k “unknown” functions of the integer variable n, the zi(n) (i = 1, 2, … h) are h “known” functions of n, and the Aij(n) are hk “known” operatorswhich are polynomials in E, each of fixed order pij but with coefficients which may vary with n. E is the usual operator defined byOur first task is to determine whether the equations (1) are self-consistent. Secondly, if they are self-consistent, we ask what follows from them for a given subset of the unknowns, e.g. for (uj+1, …, uk) in other words we wish to eliminate (u1, …, uj). In particular we wish to eliminate all the variables but one, say uk. We shall in fact find that either uk is arbitrary or else that it has only to satisfy a single linear recurrence relation : and the order of that relation is of interest to us. Thirdly, we ask that reduction to standard form is possible, with or without a transformation of the unknowns themselves.

scholarly journals Distinct partitions and overpartitions

2021 ◽  
Vol 38 (1) ◽  
pp. 149-158
Author(s):  
MIRCEA MERCA ◽  
Keyword(s):  
Partition Function ◽  
Recurrence Relation ◽  
Recurrence Relations ◽  
Convergent Series ◽  
The Other ◽  
Large Integer ◽  
Linear Recurrence ◽  
Fast Computation ◽  
Real Numbers ◽  
Very High

In 1963, Peter Hagis, Jr. provided a Hardy-Ramanujan-Rademacher-type convergent series that can be used to compute an isolated value of the partition function $Q(n)$ which counts partitions of $n$ into distinct parts. Computing $Q(n)$ by this method requires arithmetic with very high-precision approximate real numbers and it is complicated. In this paper, we investigate new connections between partitions into distinct parts and overpartitions and obtain a surprising recurrence relation for the number of partitions of $n$ into distinct parts. By particularization of this relation, we derive two different linear recurrence relations for the partition function $Q(n)$. One of them involves the thrice square numbers and the other involves the generalized octagonal numbers. The recurrence relation involving the thrice square numbers provide a simple and fast computation of the value of $Q(n)$. This method uses only (large) integer arithmetic and it is simpler to program. Infinite families of linear inequalities involving partitions into distinct parts and overpartitions are introduced in this context.

scholarly journals Matrices determined by a linear recurrence relation among entries

2003 ◽  
Vol 373 ◽  
pp. 89-99 ◽  
Author(s):  
Gi-Sang Cheon ◽  
Suk-Geun Hwang ◽  
Seog-Hoon Rim ◽  
Seok-Zun Song
Keyword(s):  
Recurrence Relation ◽  
Linear Recurrence ◽  
Linear Recurrence Relation

scholarly journals Linear recurrences in the degree sequences of monomial mappings

2008 ◽  
Vol 28 (5) ◽  
pp. 1369-1375 ◽  
Author(s):  
ERIC BEDFORD ◽  
KYOUNGHEE KIM
Keyword(s):  
Recurrence Relation ◽  
Linear Recurrence ◽  
Degree Sequences ◽  
Integer Matrix ◽  
Linear Recurrences ◽  
Monomial Map ◽  
Linear Recurrence Relation

AbstractLet A be an integer matrix, and let fA be the associated monomial map. We give a connection between the eigenvalues of A and the existence of a linear recurrence relation in the sequence of degrees.

General anharmonic oscillators

1978 ◽  
Vol 364 (1717) ◽  
pp. 265-275 ◽  
Keyword(s):  
Eigenvalue Problem ◽  
Asymptotic Behaviour ◽  
Recurrence Relation ◽  
Quantum Number ◽  
Anharmonic Oscillator ◽  
Linear Recurrence ◽  
Anharmonic Oscillators ◽  
Anharmonicity Constant ◽  
Linear Recurrence Relation

The eigenvalue problem of the general anharmonic oscillator (Hamiltonian H 2 μ ( k, λ ) = -d 2 / d x 2 + kx 2 + λx 2 μ , ( k, λ ) is investi­gated in this work. Very accurate eigenvalues are obtained in all régimes of the quantum number n and the anharmonicity constant λ . The eigenvalues, as functions of λ , exhibit crossings. The qualitative features of the actual crossing pattern are substantially reproduced in the W. K. B. approximation. Successive moments of any transition between two general anharmonic oscillator eigenstates satisfy exactly a linear recurrence relation. The asymptotic behaviour of this recursion and its consequences are examined.

Convolution Identities for Stirling Numbers of the First Kind

Integers ◽  
2010 ◽  
Vol 10 (1) ◽  
Author(s):  
Takashi Agoh ◽  
Karl Dilcher
Keyword(s):  
Recurrence Relation ◽  
Stirling Numbers ◽  
Linear Recurrence ◽  
Linear Recurrence Relation

AbstractWe derive several new convolution identities for the Stirling numbers of the first kind. As a consequence we obtain a new linear recurrence relation which generalizes known relations.

Sign in / Sign up

Export Citation Format

Share Document