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.
The aim of this paper is to give some new identities and relations related to
the some families of special numbers such as the Bernoulli numbers, the
Euler numbers, the Stirling numbers of the first and second kinds, the
central factorial numbers and also the numbers y1(n,k,?) and y2(n,k,?)
which are given Simsek [31]. Our method is related to the functional
equations of the generating functions and the fermionic and bosonic p-adic
Volkenborn integral on Zp. Finally, we give remarks and comments on our
results.
Optimizing occupancy and ILP on the GPU using a combinatorial approach