
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.
combinatorial identities, Stirling numbers of the first kind, ta111, central factorial numbers
combinatorial identities, Stirling numbers of the first kind, ta111, central factorial numbers
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
