
Summary: In this paper, we prove a general convolution formula involving the Bell polynomials and the Stirling numbers of the first kind. Our proof of the formula is algebraic and establishes an equivalent identity involving the associated exponential generating function, where we make use of induction, manipulation of finite sums and several identities to demonstrate the latter. A bijective proof that draws upon a sign-changing involution on the related combinatorial structure is given for a special case of the formula.
combinatorial identity, stirling number, bell number, QA1-939, Stirling number, Bell number, Mathematics, Combinatorial identities, bijective combinatorics, combinatorial proof
combinatorial identity, stirling number, bell number, QA1-939, Stirling number, Bell number, Mathematics, Combinatorial identities, bijective combinatorics, combinatorial proof
| 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 |
