Generalized Stirling numbers with poly-Bernoulli and poly-Cauchy numbers

2018 ◽  
Vol 14 (05) ◽  
pp. 1211-1222 ◽  
Author(s):  
Takao Komatsu ◽  
Paul Thomas Young

By using the generalized Stirling numbers studied by Hsu and Shiue, we define a new kind of generalized poly-Bernoulli and poly-Cauchy numbers. By using the formulae of the generalized Stirling numbers, we give their characteristic and combinatorial properties.

2018 ◽  
Vol 68 (4) ◽  
pp. 727-740 ◽  
Author(s):  
Toufik Mansour ◽  
Mark Shattuck

Abstract In this paper, we consider a polynomial generalization, denoted by $\begin{array}{} u_m^{a,b} \end{array}$ (n, k), of the restricted Stirling numbers of the first and second kind, which reduces to these numbers when a = 1 and b = 0 or when a = 0 and b = 1, respectively. If a = b = 1, then $\begin{array}{} u_m^{a,b} \end{array}$ (n, k) gives the cardinality of the set of Lah distributions on n distinct objects in which no block has cardinality exceeding m with k blocks altogether. We derive several combinatorial properties satisfied by $\begin{array}{} u_m^{a,b} \end{array}$ (n, k) and some additional properties in the case when a = b = 1. Our results not only generalize previous formulas found for the restricted Stirling numbers of both kinds but also yield apparently new formulas for these numbers in several cases. Finally, an exponential generating function formula is derived for $\begin{array}{} u_m^{a,b} \end{array}$ (n, k) as well as for the associated Cauchy numbers.


2021 ◽  
Vol 58 (3) ◽  
pp. 293-307
Author(s):  
Takao Komatsu ◽  
José L. Ramírez ◽  
Diego Villamizar

In this paper, we investigate a generalization of the classical Stirling numbers of the first kind by considering permutations over tuples with an extra condition on the minimal elements of the cycles. The main focus of this work is the analysis of combinatorial properties of these new objects. We give general combinatorial identities and some recurrence relations. We also show some connections with other sequences such as poly-Cauchy numbers with higher level and central factorial numbers. To obtain our results, we use pure combinatorial arguments and classical manipulations of formal power series.


2015 ◽  
Vol 45 (9) ◽  
pp. 1583-1586
Author(s):  
Yi WANG ◽  
BaoXuan ZHU ◽  
Lily Li LIU

Author(s):  
W.-S. Chou ◽  
L. C. Hsu ◽  
P. J.-S. Shiue

The object of this paper is to show that generalized Stirling numbers can be effectively used to evaluate a class of combinatorial sums involving generalized factorials.


2020 ◽  
Vol 31 (5-6) ◽  
pp. 813-831
Author(s):  
Miloud Mihoubi ◽  
Asmaa Rahim ◽  
Said Taharbouchet

2010 ◽  
Vol 23 (1) ◽  
pp. 115-120 ◽  
Author(s):  
B.S. El-Desouky ◽  
Nenad P. Cakić ◽  
Toufik Mansour

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Aimin Xu

We employ the generalized factorials to define a Stirling-type pair{s(n,k;α,β,r),S(n,k;α,β,r)}which unifies various Stirling-type numbers investigated by previous authors. We make use of the Newton interpolation and divided differences to obtain some basic properties of the generalized Stirling numbers including the recurrence relation, explicit expression, and generating function. The generalizations of the well-known Dobinski's formula are further investigated.


1938 ◽  
Vol 5 (4) ◽  
pp. 171-173 ◽  
Author(s):  
E. T. Bell

If m, n are integers, m > 0, n > 1, the generalized Stirling numbers are defined by the identity in x,


Sign in / Sign up

Export Citation Format

Share Document