scholarly journals Quantum Recurrence Relation and Its Generating Functions

2013 ◽  
Vol 49 (1) ◽  
pp. 177-188
Author(s):  
Noboru Nakanishi
Keyword(s):  
Recurrence Relation ◽  
Generating Functions

scholarly journals Explicit Formulas for the First Form (q,r)-Dowling Numbers and (q,r)-Whitney-Lah Numbers

2021 ◽  
Vol 14 (1) ◽  
pp. 65-81
Author(s):  
Roberto Bagsarsa Corcino ◽  
Jay Ontolan ◽  
Maria Rowena Lobrigas
Keyword(s):  
Recurrence Relation ◽  
Explicit Formula ◽  
Taylor Series ◽  
Generating Functions ◽  
Recurrence Relations ◽  
Difference Operator ◽  
Interpolation Formula ◽  
Explicit Formulas ◽  
Fundamental Properties ◽  
Whitney Numbers

In this paper, a q-analogue of r-Whitney-Lah numbers, also known as (q,r)-Whitney-Lah number, denoted by $L_{m,r} [n, k]_q$ is defined using the triangular recurrence relation. Several fundamental properties for the q-analogue are established such as vertical and horizontal recurrence relations, horizontal and exponential generating functions. Moreover, an explicit formula for (q, r)-Whitney-Lah number is derived using the concept of q-difference operator, particularly, the q-analogue of Newton’s Interpolation Formula (the umbral version of Taylor series). Furthermore, an explicit formula for the first form (q, r)-Dowling numbers is obtained which is expressed in terms of (q,r)-Whitney-Lah numbers and (q,r)-Whitney numbers of the second kind.

scholarly journals Identities and derivative formulas for the combinatorial and Apostol-Euler type numbers by their generating functions

Filomat ◽  
2018 ◽  
Vol 32 (20) ◽  
pp. 6879-6891
Author(s):  
Irem Kucukoglu ◽  
Yilmaz Simsek
Keyword(s):  
Recurrence Relation ◽  
Generating Functions ◽  
Stirling Numbers ◽  
Bell Numbers ◽  
New Family ◽  
Derivative Formulas ◽  
Combinatorial Sums ◽  
Computation Algorithm ◽  
Fractional Derivative Operators ◽  
And Inversion

The first aim of this paper is to give identities and relations for a new family of the combinatorial numbers and the Apostol-Euler type numbers of the second kind, the Stirling numbers, the Apostol-Bernoulli type numbers, the Bell numbers and the numbers of the Lyndon words by using some techniques including generating functions, functional equations and inversion formulas. The second aim is to derive some derivative formulas and combinatorial sums by applying derivative operators including the Caputo fractional derivative operators. Moreover, we give a recurrence relation for the Apostol-Euler type numbers of the second kind. By using this recurrence relation, we construct a computation algorithm for these numbers. In addition, we derive some novel formulas including the Stirling numbers and other special numbers. Finally, we also some remarks, comments and observations related to our results.

scholarly journals Multi-Lah numbers and multi-Stirling numbers of the first kind

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Dae San Kim ◽  
Hye Kyung Kim ◽  
Taekyun Kim ◽  
Hyunseok Lee ◽  
Seongho Park
Keyword(s):  
Recurrence Relation ◽  
Generating Functions ◽  
Stirling Numbers ◽  
Bernoulli Numbers

AbstractIn this paper, we introduce multi-Lah numbers and multi-Stirling numbers of the first kind and recall multi-Bernoulli numbers, all of whose generating functions are given with the help of multiple logarithm. The aim of this paper is to study several relations among those three kinds of numbers. In more detail, we represent the multi-Bernoulli numbers in terms of the multi-Stirling numbers of the first kind and vice versa, and the multi-Lah numbers in terms of multi-Stirling numbers. In addition, we deduce a recurrence relation for multi-Lah numbers.

scholarly journals On Generating Functions

1930 ◽  
Vol 2 (2) ◽  
pp. 71-82 ◽  
Author(s):  
W. L. Ferrar
Keyword(s):  
Differential Equation ◽  
Recurrence Relation ◽  
Generating Function ◽  
Generating Functions ◽  
Order Differential Equation ◽  
Second Order ◽  
Second Order Differential Equation ◽  
Image Position ◽  
Three Term Recurrence Relation ◽  
Sequence Of Functions

It is well known that the polynomial in x,has the following properties:—(A) it is the coefficient of tn in the expansion of (1–2xt+t2)–½;(B) it satisfies the three-term recurrence relation(C) it is the solution of the second order differential equation(D) the sequence Pn(x) is orthogonal for the interval (— 1, 1),i.e. whenSeveral other familiar polynomials, e.g., those of Laguerre Hermite, Tschebyscheff, have properties similar to some or all of the above. The aim of the present paper is to examine whether, given a sequence of functions (polynomials or not) which has one of these properties, the others follow from it : in other words we propose to examine the inter-relation of the four properties. Actually we relate each property to the generating function.

scholarly journals Recurrence Relations for Marginal and Joint Moment Generating Functions of Topp-Leone Generated Exponential Distribution based on Record Values and its Characterization

2020 ◽  
Vol 18 (1) ◽  
Author(s):  
Zaki Anwar ◽  
Neetu Gupta ◽  
Mohd. Akram Raza Khan ◽  
Qazi Azhad Jamal
Keyword(s):  
Exponential Distribution ◽  
Recurrence Relation ◽  
Generating Functions ◽  
Recurrence Relations ◽  
Moment Generating Function ◽  
Record Values ◽  
Joint Moment ◽  
Moment Generating Functions ◽  
Lower Record ◽  
Lower Record Values

The exact expressions and some recurrence relations are derived for marginal and joint moment generating functions of kth lower record values from Topp-Leone Generated (TLG) Exponential distribution. This distribution is characterized by using the recurrence relation of the marginal moment generating function of kth lower record values.

Generating functions and semi-classical orthogonal polynomials

1994 ◽  
Vol 124 (5) ◽  
pp. 1003-1011 ◽  
Author(s):  
Pascal Maroni ◽  
Jeannette Van Iseghem
Keyword(s):  
Differential Equation ◽  
Partial Differential Equation ◽  
Orthogonal Polynomials ◽  
Recurrence Relation ◽  
Generating Function ◽  
Generating Functions ◽  
Special Form ◽  
Classical Orthogonal Polynomials ◽  
Order Linear ◽  
First Order

An orthogonal family of polynomials is given, and a link is made between the special form of the coefficients of their recurrence relation and a first-order linear homogenous partial differential equation satisfied by the associated generating function. A study is also made of the semiclassical character of such families.

Gaussian third-order Jacobsthal and Gaussian third-order Jacobsthal–Lucas polynomials and their properties

2020 ◽  
pp. 2150076
Author(s):  
Gamaliel Cerda-Morales
Keyword(s):  
Recurrence Relation ◽  
Generating Functions ◽  
Third Order ◽  
Lucas Polynomials ◽  
Binet Formula

In this paper, the Gaussian third-order Jacobsthal and Gaussian third-order Jacobsthal–Lucas polynomials are defined. Then Binet formula and generating functions of these numbers are given. Also, some summation identities for Gaussian third-order Jacobsthal and Gaussian third-order Jacobsthal–Lucas polynomials are obtained by using the recurrence relation satisfied by them. Then, some linear and quadratic relations are given between Gaussian third-order Jacobsthal and Gaussian third-order Jacobsthal–Lucas polynomials.

scholarly journals Enumeration of Generalized $BCI$ Lambda-terms

10.37236/3051 ◽  
2013 ◽  
Vol 20 (4) ◽  
Author(s):  
Olivier Bodini ◽  
Danièle Gardy ◽  
Bernhard Gittenberger ◽  
Alice Jacquot
Keyword(s):  
Differential Equation ◽  
Differential Equations ◽  
Recurrence Relation ◽  
Generating Function ◽  
Generating Functions ◽  
Combinatory Logic ◽  
Efficient Computation ◽  
Asymptotic Number ◽  
Axiom Systems

We investigate the asymptotic number of elements of size $n$ in a particular class of closed lambda-terms (so-called $BCI(p)$-terms) which are related to axiom systems of combinatory logic. By deriving a differential equation for the generating function of the counting sequence we obtain a recurrence relation which can be solved asymptotically. We derive differential equations for the generating functions of the counting sequences of other more general classes of terms as well: the class of $BCK(p)$-terms and that of closed lambda-terms. Using elementary arguments we obtain upper and lower estimates for the number of closed lambda-terms of size $n$. Moreover, a recurrence relation is derived which allows an efficient computation of the counting sequence. $BCK(p)$-terms are discussed briefly.

Gaussian Padovan and Gaussian Perrin numbers and properties of them

2019 ◽  
Vol 12 (06) ◽  
pp. 2040014
Author(s):  
Meral Yaşar Kartal
Keyword(s):  
Recurrence Relation ◽  
Generating Functions ◽  
Binet Formula

In this paper, the Gaussian Padovan and Gaussian Perrin numbers are defined. Then Binet formula and generating functions of these numbers are given. Also, some summation identities for Gaussian Padovan and Gaussian Perrin numbers are obtained by using the recurrence relation satisfied by them. Then two relations are given between Gaussian Padovan and Gaussian Perrin numbers.

Sign in / Sign up

Export Citation Format

Share Document