
arXiv: 2404.09891
By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial identities (Theorems 3.1 and 3.3) are established as applications, that contain some well–known convolution formulae on Stirling numbers as special cases.
convolution formula, generating function, 05A10, 11B65, recurrence relation, Exact enumeration problems, generating functions, Stirling number of the first kind, FOS: Mathematics, Bell and Stirling numbers, Mathematics - Combinatorics, Combinatorics (math.CO), Factorials, binomial coefficients, combinatorial functions, Stirling number of the second kind
convolution formula, generating function, 05A10, 11B65, recurrence relation, Exact enumeration problems, generating functions, Stirling number of the first kind, FOS: Mathematics, Bell and Stirling numbers, Mathematics - Combinatorics, Combinatorics (math.CO), Factorials, binomial coefficients, combinatorial functions, Stirling number of the second kind
| selected citations These citations are derived from selected sources. 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). | 0 | |
| 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. | Average | |
| 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 |
