2019
DOI: 10.3390/sym11030352
|View full text |Cite
|
Sign up to set email alerts
|

On Generating Functions for Boole Type Polynomials and Numbers of Higher Order and Their Applications

Abstract: The purpose of this manuscript is to study and investigate generating functions for Boole type polynomials and numbers of higher order. With the help of these generating functions, many properties of Boole type polynomials and numbers are presented. By applications of partial derivative and functional equations for these functions, derivative formulas, recurrence relations and finite combinatorial sums involving the Apostol-Euler polynomials, the Stirling numbers and the Daehee numbers are given.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
12
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 21 publications
0
12
0
Order By: Relevance
“…Observe that Bn(x)=limω1Bn(x;ω). Here, B n ( x ) denotes the Bernoulli polynomials (cf. previous studies 1‐5,7‐33,34‐65,66,67 ; see also the references cited therein).…”
Section: Introductionmentioning
confidence: 60%
“…Observe that Bn(x)=limω1Bn(x;ω). Here, B n ( x ) denotes the Bernoulli polynomials (cf. previous studies 1‐5,7‐33,34‐65,66,67 ; see also the references cited therein).…”
Section: Introductionmentioning
confidence: 60%
“…By applying the generating function methods, Simsek 9 established several novel identities, inequalities, and relations for the Peters type polynomials and for some combinatorial numbers and polynomials. For further studies, the reader can consult previous works [7][8][9][10][11][12][13][14][15][16][17][18] and plenty of references cited therein.…”
Section: Introductionmentioning
confidence: 99%
“…8,12 , p. 128, 11 ) See, for detail, also (cf. [13][14][15][16][17][18][19][20][21][22][23] ). Setting x = 0 in (5), we have the Peters numbers, s n ( , ) = s n (0; , ).…”
Section: Introductionmentioning
confidence: 99%