Abstract

The first aim of this paper is to construct new generating functions for the generalized {\lambda}-Stirling type numbers of the second kind, generalized array type polynomials and generalized Eulerian type polynomials and numbers, attached to Dirichlet character. We derive various functional equations and differential equations using these generating functions. The second aim is provide a novel approach to deriving identities including multiplication formulas and recurrence relations for these numbers and polynomials using these functional equations and differential equations. Furthermore, by applying p-adic Volkenborn integral and Laplace transform, we derive some new identities for the generalized {\lambda}-Stirling type numbers of the second kind, the generalized array type polynomials and the generalized Eulerian type polynomials. We also give many applications related to the class of these polynomials and numbers.

Highlights

  • The first aim of this paper is to construct new generating functions for the generalized λ-Stirling type numbers of the second kind, generalized array type polynomials and generalized Eulerian type polynomials and numbers

  • In the literature, one can find extensive investigations related to the generating functions for the Bernoulli, Euler and Genocchi numbers and polynomials and their generalizations, the λ-Stirling numbers of the second kind, the array polynomials and the Eulerian polynomials, related to nonnegative real parameters, have not been studied yet

  • We investigate and introduce fundamental properties and many new identities for the generalized λ-Stirling type numbers of the second kind, the generalized array type polynomials and the generalized Eulerian type polynomials and numbers

Read more

Summary

Comparing the coefficients of tm m!

On both sides of the above equation, we arrive at the desired result. Generating functions for the polynomial Svn(x; a, b, c; λ) can be defined as follows. The generalized array type polynomials Svn(x; a, b; λ) are defined by means of the following generating function: gv(x, t; a, b; λ) =. By using ( ) and binomial theorem, we arrive at the desired result. Which yields the generating function for the array polynomials Svn(x) studied by Chang and Ha [ ]; see (cf [ , ]). Comparing the coefficients of tn on both sides of the above equation, we arrive at the desired result. ∂j ∂ xj gv(x, t; tj(ln b)j gv(x, t; λ) From this equation, we arrive at higher order derivative of the array type polynomials by the following theorem.

Comparing the coefficients of tn n!
For n
It is easily observe that
Now we assume
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.