Formulas and Combinatorial Identities for Catalan-Type Numbers And Polynomials: Their Analysis with Computational Algorithms (pages:158-177)
I. Kucukoglu1, Y. Simsek2
10.30546/1683-6154.21.2.2022.1581Department of Engineering, Fundamental Sciences, Faculty of Engineering, Alanya Alaaddin Keykubat University , Antalya, Turkey
2Department of Mathematics, Faculty of Science, University of Akdeniz, Antalya, Turkey
Abstract. In this paper, we aim to provide generating functions for a higher-order expansion of a certain class of Catalan-type numbers and polynomials, and to give some computational algorithms for evaluating these numbers and polynomials. With the implementation of these computational algorithms in Mathematica by Wolfram programming language, we provide some plots drawn depending on varying special cases of the Catalan-type polynomials of higher-order. By using generating functions, we also derive some formulas and combinatorial identities. By applying not only the Riemann integral, but also the p-adic integrals to these formulas, we get some integral formulas involving the Catalan-type numbers and polynomials, the factorial polynomials, the Stirling numbers, the Bernoulli numbers of the second kind, the Daehee and Changhee numbers and polynomials. By using these integral formulas, we derive other combinatorial sums including the Catalan-type numbers. In addition, we provide some finite and infinite series representations which arise from the Catalan-type numbers.
Keywords: Generating Functions, p-adic Integrals, Computational Algorithms, Special Numbers and Polynomials, Binomial Coefficients, Factorial Polynomials, Harmonic Numbers, Catalan Numbers, Bernoulli Numbers, Euler Numbers, Stirling Numbers, Daehee Numbers and Polynomials, Changhee Numbers and Polynomials, Complete Bell Polynomials, Finite Sums.
AMS Subject Classification: 05A10, 05A15, 05A19, 11B37, 11B68, 11B83, 11S80, 11Y99, 68W01.