2016
DOI: 10.1007/s10998-016-0142-3
|View full text |Cite
|
Sign up to set email alerts
|

Appell polynomial sequences with respect to some differential operators

Abstract: We present a study of a specific kind of lowering operator, herein called Λ, which is defined as a finite sum of lowering operators, proving that this configuration can be altered, for instance, by the use of Stirling numbers. We characterize the polynomial sequences fulfilling an Appell relation with respect to Λ, and considering a concrete cubic decomposition of a simple Appell sequence, we prove that the polynomial component sequences are Λ-Appell, with Λ defined as previously, although by a three term sum.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 17 publications
(29 reference statements)
0
7
0
Order By: Relevance
“…The technical approach has been already tackled in previous contributions where the authors efforts were mainly focused on an Appel behavior (e.g. [20]). We shall now proceed with the introduction of a wider definition which assembles all the referred situations.…”
Section: 13)mentioning
confidence: 99%
See 4 more Smart Citations
“…The technical approach has been already tackled in previous contributions where the authors efforts were mainly focused on an Appel behavior (e.g. [20]). We shall now proceed with the introduction of a wider definition which assembles all the referred situations.…”
Section: 13)mentioning
confidence: 99%
“…n = 0, n ≥ 0, matching (2.5), so that J is an isomorphism. If k = 1, then J imitates the usual derivative and is commonly called a lowering operator [6,11,20]. Given a MPS {P n } n≥0 and a non-negative integer k, let us define its (normalized) J-image sequence of polynomials as follows, and notate its dual sequence by {ũ n } n≥0 .…”
Section: 13)mentioning
confidence: 99%
See 3 more Smart Citations