Abstract

By using the calculus of finite differences methods and the umbral calculus, we construct recurrence relations for a new class of special numbers. Using this recurrence relation, we define generating functions for this class of special numbers and also new classes of special polynomials. We investigate some properties of these generating functions. By using these generating functions with their functional equations, we obtain many new and interesting identities and relations related to these classes of special numbers and polynomials, the Bernoulli numbers and polynomials, the Euler numbers and polynomials, the Stirling numbers. Finally, some derivative formulas and integral formulas for these classes of special numbers and polynomials are given. In general, this article includes results that have the potential to be used in areas such as discrete mathematics, combinatorics analysis and their applications.

Highlights

  • Yilmaz SimsekBy using the calculus of finite differences methods and the umbral calculus, we construct recurrence relations for a new class of special numbers

  • Recurrence relations have many applications in discrete mathematics and related areas

  • We investigate some properties of this generating function and these numbers

Read more

Summary

Yilmaz Simsek

By using the calculus of finite differences methods and the umbral calculus, we construct recurrence relations for a new class of special numbers. Using this recurrence relation, we define generating functions for this class of special numbers and new classes of special polynomials. We investigate some properties of these generating functions. By using these generating functions with their functional equations, we obtain many new and interesting identities and relations related to these classes of special numbers and polynomials, the Bernoulli numbers and polynomials, the Euler numbers and polynomials, the Stirling numbers. This article includes results that have the potential to be used in areas such as discrete mathematics, combinatorics analysis and their applications

INTRODUCTION
Comparing the coefficients of wn n!
Since we also get
Full Text
Published version (Free)

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