2014
DOI: 10.1016/j.laa.2014.09.009
|View full text |Cite
|
Sign up to set email alerts
|

A determinantal approach to Sheffer sequences

Abstract: In this paper, by using the theory of Riordan arrays and the relations between Sheffer sequences and Riordan arrays, we give a determinantal definition for Sheffer sequences. Based on this new definition, some general properties of Sheffer sequences are reproved, and the determinantal representations of some well-known Sheffer sequences are presented.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 21 publications
(17 citation statements)
references
References 16 publications
0
17
0
Order By: Relevance
“…[10] has given a new approach to Bernoulli polynomials which was further extended to provide the determinantal definition of the Appell polynomials [11]. Recently, the determinantal definition of Appell sequences is extended to Sheffer sequences by using the theory of Riordan arrays [29].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…[10] has given a new approach to Bernoulli polynomials which was further extended to provide the determinantal definition of the Appell polynomials [11]. Recently, the determinantal definition of Appell sequences is extended to Sheffer sequences by using the theory of Riordan arrays [29].…”
Section: Discussionmentioning
confidence: 99%
“…The determinantal approach considered in [10,11,29] n (x, y, z)(n = 0, 1, 2, ..., ) are the Legendre-Gould Hopper polynomials defined by equation (1.2), S n×(n+1) = (a j−1,i−1 )1 ≤ i ≤ n, 1 ≤ j ≤ n+1 and α n,k is the (n, k) entry of the Riordan array (g(t), f (t)). are the Legendre-Gould Hopper polynomials defined by equation (1.1), S n×(n+1) = (α j−1,i−1 )1 ≤ i ≤ n, 1 ≤ j ≤ n + 1 and a n,k is the (n, k) entry of the Riordan array (g(t), f (t)).…”
Section: Discussionmentioning
confidence: 99%
“…Using determinant representation of binomial coefficient ( n k ) [23], the above equations can be expressed as:…”
Section: Applicationsmentioning
confidence: 99%
“…Later on, their study, leaded by Rota and Roman, developed in what it is known today as Umbral Calculus [26][27][28]. In contrast, a more recent approach has been made using matrix and determinantal representations, see, e.g., [1,2,13,14,37,38]. Also, current research has focussed on special sequences [16] and other alternative descriptions of the theory, for instance, through random variables [3,33].…”
Section: Introductionmentioning
confidence: 99%